Related papers: Split Orders and Convex Polytopes in Buildings

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…

We generalize staircase codes and tiled diagonal zipper codes, preserving their key properties while allowing each coded symbol to be protected by arbitrarily many component codewords rather than only two. This generalization which we term…

Let SYT_n be the set of all standard Young tableaux with n cells. After recalling the definitions of four partial orders, the weak, KL, geometric and chain orders on SYT_n and some of their crucial properties, we prove three main results:…

Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…

A closed convex polytope in n dimensions defined by m linear inequality constraints is considered. If L is a straight line drawn in any direction from any feasible point P, then in general, it intersects every constraint at one point,…

There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank $\omega_1^{CK}+1$. Makkai produced a structure of Scott…

M.Levitin and E.Shargorodsky purposed in a recent article, [math.SP/0212087], the use of the so called ``second order relative spectrum'', to find eigenvalues of self-adjoint operators in gaps of the essential spectrum. Let $M$ be a…

Generalizing the notion of Newton polytope, we define the Newton-Okounkov body, respectively, for semigroups of integral points, graded algebras, and linear series on varieties. We prove that any semigroup in the lattice Z^n is…

The class of skew lattices can be seen as an algebraic category. It models an algebraic theory in the category of Sets where the Green's relation D is a congruence describing an adjunction to the category of Lattices. In this paper we will…

We define an n-dimensional polytope Pi_n(x), depending on parameters x_i>0, whose combinatorial properties are closely connected with empirical distributions, plane trees, plane partitions, parking functions, and the associahedron. In…

Take a sequence of couples $(G_n,K_n)_n$, where $G_n$ is a group and $K_n$ is a sub-group of $G_n.$ Under some conditions, we are able to give a formula that shows the form of the structure coefficients that appear in the product of…

We study the problem of decomposing (clustering) a tree with respect to costs attributed to pairs of nodes, so as to minimize the sum of costs for those pairs of nodes that are in the same component (cluster). For the general case and for…

There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of parking functions a poset whose Hasse diagram is the union of…

In this thesis we studied the structure coefficients and especially their dependence on $n$ in the case of a sequence of double-class algebras. The first chapter is dedicated to the study of the structure coefficients in the general cases…

Metric embeddings are central to metric theory and its applications. Here we consider embeddings of a different sort: maps from a set to subsets of a metric space so that distances between points are approximated by minimal distances…

We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…

Building on early work by Stevo Todorcevic, we describe a theory of stationary subtrees of trees of successor-cardinal height. We define the diagonal union of subsets of a tree, as well as normal ideals on a tree, and we characterize…

Much like in the theory of algebraic geometry, we develop a correspondence between certain types of algebraic and geometric objects. The basic algebraic environment we work in is the a semifield of fractions H(x1,...,xn) of the polynomial…

Let $(R,M,k)$ be a complete local ring (not necessarily Noetherian). As the first main result of this article, we prove that in the unequal characteristic case $\Char(R)\neq\Char(k)$, the natural surjective map between the groups of units…

We introduce an algorithm that performs a one-directional mesh overset of a parallel forest of octrees with another distributed mesh of unrelated partition. The forest mesh consists of several adaptively refined octrees. Individual smooth…