Related papers: On the dimension of downsets of integer partitions…
The Dushnik-Miller dimension of a partially-ordered set $P$ is the smallest $d$ such that one can embed $P$ into a product of $d$ linear orders. We prove that the dimension of the divisibility order on the interval $\{1, \dotsc, n\}$, is…
We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…
The Dushnik--Miller dimension of a poset $P$ is the least $d$ for which $P$ can be embedded into a product of $d$ chains. Lewis and Souza showed that the dimension of the divisibility order on the interval of integers $[N/\kappa, N]$ is…
For a finite partially ordered set we calculate the dimension of the variety of its subspace representations having fixed dimension vector. The dimension is given in terms of the Euler quadratic form associated with a partially ordered set,…
A partial group with $n+1$ elements is, when regarded as a symmetric simplicial set, of dimension at most $n$. This dimension is $n$ if and only if the partial group is a group. As a consequence of the first statement, finite partial groups…
In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…
After calculating the Dushnik-Miller dimension of Minkowski spaces to be countable infinity, we define a novel notion of dimension for ordered spaces recovering the correct manifold dimension and obtain a corresponding obstruction for the…
We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…
Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and mathematics. In this article we focus on one of the most…
We shall define a general notion of dimension, and study groups and rings whose interpretable sets carry such a dimensio. In particular, we deduce chain conditions for groups, definability results for fields and domains, and show that…
The paper is devoted to developing subdifferential theory for set-valued mappings taking values in ordered infinite-dimensional spaces. This study is motivated by applications to problems of vector and set optimization with various…
We show the existence of a series of transforms that capture several structures that underlie higher-dimensional partitions. These transforms lead to a sequence of triangles whose entries are given combinatorial interpretations as the…
This work is an analytical and numerical study of the composition of several fractals into one and of the relation between the composite dimension and the dimensions of the component fractals. In the case of composition of standard IFS with…
This paper systematically studies finite rank dimension groups, as well as finite dimensional ordered real vector spaces with Riesz interpolation. We provide an explicit description and classification of finite rank dimension groups, in the…
We consider subsets of the (symbolic) sequence space that are invariant under the action of the semigroup of multiplicative integers. A representative example is the collection of all 0-1 sequences $(x_k)$ such that $x_k x_{2k}=0$ for all…
We investigate how the Hausdorff dimensions of microsets are related to the dimensions of the original set. It is known that the maximal dimension of a microset is the Assouad dimension of the set. We prove that the lower dimension can…
We discuss the definition and measurability questions of random fractals and find under certain conditions a formula for upper and lower Minkowski dimensions. For the case of a random self-similar set we obtain the packing dimension.
We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…
Let $A$ be a simple algebra over a field $F$. Under a mild cardinality assumption on $F$, we determine the greatest possible dimension for an $F$-affine subspace of $A$ that is included in the group of units $A^\times$, and we describe the…
For some numerical semigroup rings of small embedding dimension, namely those of embedding dimension 3, and symmetric or pseudosymmetric of embedding dimension 4, presentations has been determined in the literature. We extend these results…