Additive manufacture (AM) enables a greatly increased design freedom owing to its ability to manufacture otherwise difficult or impossible geometries. However, design creativity can often present itself as a barrier to realising the advantages that AM could offer. In this study the use of AM, bioresorbable materials and lattice design is considered as a method of satisfying contradicting design requirements during fracture healing. Often, immediately after a fracture high stiffness fixation is required; contradictingly during the remodelling phase high stiffness can inhibit bone healing. This study proposes the use of a bioresorbable body centred cubic (BCC) or face centred cubic (FCC) lattice structure to meet the need for tailored variation in implant stiffness over time. To reduce computational expense of lattice modelling a method is outlined, including the use of homogenisation. Results show homogenised representations perform within 5.2% and 1.4% for BCC and FCC unit cells respectively, with a 95% reduction in computational expense. Using resorption rates from the literature, time-dependent change in unit cell geometry was also modelled, showing the way in which a decrease in stiffness over time could be achieved.

Given an irreducible lattice $\Gamma $ in the product of higher rank simple Lie groups, we prove a co-finiteness result for the $\Gamma $-invariant von Neumann subalgebras of the group von Neumann algebra $\mathcal {L}(\Gamma )$, and for the $\Gamma $-invariant unital $C^*$-subalgebras of the reduced group $C^*$-algebra $C^*_{\mathrm {red}}(\Gamma )$. We use these results to show that: (i) every $\Gamma $-invariant von Neumann subalgebra of $\mathcal {L}(\Gamma )$ is generated by a normal subgroup; and (ii) given a weakly mixing unitary representation $\pi $ of $\Gamma $, every $\Gamma $-equivariant conditional expectation on $C^*_\pi (\Gamma )$ is the canonical conditional expectation onto the $C^*$-subalgebra generated by a normal subgroup.

We study combinatorial and order theoretic structures arising from the fragment of combinatory logic spanned by the basic combinator ${{\mathbf{M}}}$ . This basic combinator, named as the Mockingbird by Smullyan, is defined by the rewrite rule ${{\mathbf{M}}} \mathsf{x}_1 \to \mathsf{x}_1 \mathsf{x}_1$ . We prove that the reflexive and transitive closure of this rewrite relation is a partial order on terms on ${{\mathbf{M}}}$ and that all connected components of its rewrite graph are Hasse diagram of lattices. This last result is based on the introduction of new lattices on duplicative forests, which are sorts of treelike structures. These lattices are not graded, not self-dual, and not semi-distributive. We present some enumerative properties of these lattices like the enumeration of their elements, of the edges of their Hasse diagrams, and of their intervals. These results are derived from formal power series on terms and on duplicative forests endowed with particular operations.

Given a finite lattice L that can be embedded in the recursively enumerable (r.e.) Turing degrees $\langle \mathcal {R}_{\mathrm {T}},\leq _{\mathrm {T}}\rangle $ , we do not in general know how to characterize the degrees $\mathbf {d}\in \mathcal {R}_{\mathrm {T}}$ below which L can be bounded. The important characterizations known are of the $L_7$ and $M_3$ lattices, where the lattices are bounded below $\mathbf {d}$ if and only if $\mathbf {d}$ contains sets of “fickleness” $>\omega $ and $\geq \omega ^\omega $ respectively. We work towards finding a lattice that characterizes the levels above $\omega ^2$ , the first non-trivial level after $\omega $ . We introduced a lattice-theoretic property called “ $3$ -directness” to describe lattices that are no “wider” or “taller” than $L_7$ and $M_3$ . We exhaust the 3-direct lattices L, but they turn out to also characterize the $>\omega $ or $\geq \omega ^\omega $ levels, if L is not already embeddable below all non-zero r.e. degrees. We also considered upper semilattices (USLs) by removing the bottom meet(s) of some 3-direct lattices, but the removals did not change the levels characterized. This leads us to conjecture that a USL characterizes the same r.e. degrees as the lattice on which the USL is based. We discovered three 3-direct lattices besides $M_3$ that also characterize the $\geq \omega ^\omega $ -levels. Our search for a $>\omega ^2$ -candidate therefore involves the lattice-theoretic problem of finding lattices that do not contain any of the four $\geq \omega ^\omega $ -lattices as sublattices.

Abstract prepared by Liling Ko.

E-mail: [email protected]

URL: http://sites.nd.edu/liling-ko/

Suppose G is an amenable locally compact group with lattice subgroup $\Gamma $ . Grosvenor [‘A relation between invariant means on Lie groups and invariant means on their discrete subgroups’, Trans. Amer. Math. Soc.288(2) (1985), 813–825] showed that there is a natural affine injection $\iota : {\text {LIM}}(\Gamma )\to {\text {TLIM}}(G)$ and that $\iota $ is a surjection essentially in the case $G={\mathbb R}^d$ , $\Gamma ={\mathbb Z}^d$ . In the present paper it is shown that $\iota $ is a surjection if and only if $G/\Gamma $ is compact.

A new theoretical method for examining gerrymandering is presented based on lattice models of voters, in which districts are constructed by partitioning the lattice. We propose three novel algorithms for constructing equal-population, connected districts which favor the gerrymanderer and incorporate the spatial distribution of voters. Due to the probabilistic population fluctuations inherent to our voter models, Monte Carlo techniques can be applied to study the impact of gerrymandering. We use the method developed here to compare our different gerrymandering algorithms, show approaches which ignore spatial data lead to (legally prohibited) disconnected districts, and examine the effectiveness of isoperimetric quotient tests.

We prove a super-rigidity result for algebraic representations over complete fields of irreducible lattices in products of groups and lattices with dense commensurator groups. We derive criteria for the non-linearity of such groups.

The homomorphic image of a congruence is always a tolerance (relation) but, within a given variety, a tolerance is not necessarily obtained this way. By a Maltsev-like condition, we characterise varieties whose tolerances are homomorphic images of their congruences (TImC). As corollaries, we prove that the variety of semilattices, all varieties of lattices, and all varieties of unary algebras have TImC. We show that a congruence n-permutable variety has TImC if and only if it is congruence permutable, and construct an idempotent variety with a majority term that fails TImC.

Let be a lattice in the real simple Lie group L. If L is of rank at least 2 (respectively locally isomorphic to Sp(n, 1)) any unbounded morphism ρ : Γ → G into a simple real Lie group G essentially extends to a Lie morphism ρL : L → G (Margulis's superrigidity theorem, respectively Corlette's theorem). In particular any such morphism is infinitesimally, thus locally, rigid. On the other hand, for L = SU(n, 1) even morphisms of the form are not infinitesimally rigid in general. Almost nothing is known about their local rigidity. In this paper we prove that any cocompact lattice Γ in SU(n, 1) is essentially locally rigid (while in general not infinitesimally rigid) in the quaternionic groups Sp(n, 1), SU(2n, 2) or SO(4n, 4) (for the natural sequence of embeddings SU(n, 1) ⊂ Sp(n, 1) ⊂ SU(2n, 2) ⊂ SO(4n, 4)).

In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of 2D-gons (hexagons, octagons, decagons, etc.). We show that the sets of partitions, ordered with a simple dynamics, have the distributive lattice structure. Likewise, we show that the set of tilings of a 2D-gon is the disjoint union of distributive lattices which we describe. We also discuss the special case of linear integer partitions, for which other dynamical models exist.