Related papers: Upho lattices II: ways of realizing a core

We investigate two and three-dimensional shell-structured-inflatable froths, which can be constructed by a recursion procedure adding successive layers of cells around a germ cell. We prove that any froth can be reduced into a system of…

We consider polynomial maps $f:\C\to\C$ of degree $d\ge 2$, or more generally polynomial maps from a finite union of copies of $\C$ to itself which have degree two or more on each copy. In any space $\p^{S}$ of suitably normalized maps of…

We prove that the isomorphism type of the subrack lattice of a finite group determines the nilpotence class. We analyze the problem of estimating the orders of the group elements corresponding to the atoms of the subrack lattice. As a…

We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups…

This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by…

A group $G$ with conjugation operation is a rack. We call such racks \emph{group racks}. In this paper we study finite group racks via their subrack lattices. Heckenberger, Shareshian, and Welker proved that the isomorphism type of the…

Here we prove classification results announced in Part I (alg-geom/9711032). We classify maximal hyperbolic root systems of the rank 3 having restricted arithmetic type and a generalized lattice Weyl vector $\rho$ with $\rho^2\ge 0$ (i.e.…

In this paper, we prove that the set of triangulations of a polygon can be equipped with an order to become a lattice. First, we define this order. In [HN99], authors defined the flip operator and then prove some properties of the graph of…

Quasi-lattices are introduced in terms of 'join' and 'meet' operations. It is observed that quasi-lattices become lattices when these operations are associative and when these operations satisfy 'modularity' conditions. A fundamental…

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

A retract of a graph $\Gamma$ is an induced subgraph $\Psi$ of $\Gamma$ such that there exists a homomorphism from $\Gamma$ to $\Psi$ whose restriction to $\Psi$ is the identity map. A graph is a core if it has no nontrivial retracts. In…

A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…

We recover the rays in the tensor product of Hilbert spaces within a larger class of so called `states of compoundness', structured as a complete lattice with the `state of separation' as its top element. At the base of the construction…

Motivated by the theory of correspondence functors, we introduce the notion of {\em germ} in a finite poset, and the notion of {\em germ extension} of a poset. We show that any finite poset admits a largest germ extension called its {\em…

We show that there is a sentence $\varphi$ in the first order language of groups such that a finitely generated group $\Gamma$ satisfies $\varphi$ if and only if $\Gamma$ is isomorphic to a group of the form $\mathrm{PSL}_n(O)$, where $n…

The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}_=$) allows us to define structures on sets. We develop the syntax, semantics and…

In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…

We prove that the rank polynomial of the lattice of order ideals of a loop fence poset is unimodal. This poset arises as the poset of join-irreducibles in the lattice of good matchings of loop graphs associated with notched arcs.…

In the unidimensional unfolding model, given m objects in general position there arise 1+m(m-1)/2 rankings. The set of rankings is called the ranking pattern of the m given objects. By changing these m objects, we can generate various…

This work serves as an opening and basis of an ongoing program investigating topological and geometric aspects of the moduli space of smooth fiberings on a manifold. The present paper focuses on the algebraic and differential topology of…