Related papers: The Dimension of Divisibility Orders and Multiset …

Given an integer $d \geq 2$, $s \in (0,1]$, and $t \in [0,2(d-1)]$, suppose a set $X$ in $\mathbb{R}^d$ has the following property: there is a collection of lines of packing dimension $t$ such that every line from the collection intersects…

Given a regular multiset $M$ on $[n]=\{1,2,\ldots,n\}$, a partial order $R$ on $M$, and a label map $\pi : [n] \rightarrow \mathbb{N}$ defined by $\pi(i) = k_i$ with $\sum_{i=1}^{n}\pi (i) = N$, we define a pomset block metric…

In $1941$ Dushnik and Miller introduced the concept of dimension of a poset. In $2020$ Bhavale and Waphare introduced the concept of an RC-lattice as a lattice in which all the reducible elements are lying on a chain. In this paper, we…

We prove three results on the dimension structure of complexity classes. 1. The Point-to-Set Principle, which has recently been used to prove several new theorems in fractal geometry, has resource-bounded instances. These instances…

Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…

The Johnson-Lindenstrauss transform is a fundamental method for dimension reduction in Euclidean spaces, that can map any dataset of $n$ points into dimension $O(\log n)$ with low distortion of their distances. This dimension bound is tight…

Dobi\'nski set $\mathcal{D}$ is an exceptional set for a certain infinite product identity, whose points are characterized as having exceedingly good approximations by dyadic rationals. We study the Hausdorff dimension and logarithmic…

The width of a poset is the size of its largest antichain. Sperner's theorem states that $(2^{[n]},\subset)$ is a poset whose width equals the size of its largest layer. We show that Hamming ball posets also have this property. This extends…

The Lyubeznik size of a monomial ideal $I$ of a polynomial ring $S$ is a lower bound for the Stanley depth of $I$ decreased by $1$. A proof given by Herzog-Popescu-Vladoiu had a gap which is solved here.

We prove new cases of reasonable bounds for the polynomial Szemer\'{e}di theorem both over $\mathbb{Z}/N\mathbb{Z}$ with $N$ prime and over the integers. In particular, we prove reasonable bounds for Szemer\'edi's theorem in the integers…

The outer multiset dimension ${\rm dim}_{\rm ms}(G)$ of a graph $G$ is the cardinality of a smallest set of vertices that uniquely recognize all the vertices outside this set by using multisets of distances to the set. It is proved that…

The boxicity of a graph is the smallest dimension $d$ allowing a representation of it as the intersection graph of a set of $d$-dimensional axis-parallel boxes. We present a simple general approach to determining the boxicity of a graph…

The notion of noncrossing partitions of a partially ordered set (poset) is introduced here. When the poset in question is $[n]=\{1,2,\dots, n\}$ with the complete order of natural numbers, conventional noncrossing partitions arise. The…

A cutset is a non-empty finite subset of $\mathbb{Z}^d$ which is both connected and co-connected. A cutset is odd if its vertex boundary lies in the odd bipartition class of $\mathbb{Z}^d$. Peled suggested that the number of odd cutsets…

In the Minimum $d$-Dimensional Arrangement Problem (d-dimAP) we are given a graph with edge weights, and the goal is to find a 1-1 map of the vertices into $\mathbb{Z}^d$ (for some fixed dimension $d\geq 1$) minimizing the total weighted…

In this work we introduce the concept of a sub-space decomposition, subject to a partition of the coordinates. Considering metrics determined by partial orders in the set of coordinates, the so called poset metrics, we show the existence of…

Let $E$ be a subset of a doubling metric space $(X,d)$. We prove that for any $s\in [0, \dim_{A}E]$, where $\dim_{A}$ denotes the Assouad dimension, there exists a subset $F$ of $E$ such that $\dim_{A}F=s$. We also show that the same…

We study $q$-ary codes with distance defined by a partial order of the coordinates of the codewords. Maximum Distance Separable (MDS) codes in the poset metric have been studied in a number of earlier works. We consider codes that are close…

The classical 1991 result by Brightwell and Winkler states that the number of linear extensions of a poset is #P-complete. We extend this result to posets with certain restrictions. First, we prove that the number of linear extension for…

In this paper, for a given Dirichlet character mod $N$ with $4\nmid N$, we give a lower bound of order $\sqrt{s/\log(s)}$ for the dimension of the $\mathbb{Q}(e^{2i\pi/N})$-vector space spanned by the values of its $L$-function at integers…