Related papers: Local Dimension is Unbounded for Planar Posets
Let $(M, g)$ be a closed Riemannian manifold, where g is $C^1$-smooth metric. Consider the sequence of eigenfunctions $u_k$ of the Laplace operator on M. Let $B$ be a ball on $M$. We prove a sharp estimate of the number of nodal domains of…
In 2016, Ananyan and Hochster gave the first proof of a positive answer to Stillman's Question, which asked for a bound on the projective dimension of a graded polynomial ideal purely in terms of the number and degrees of its generators.…
The notion of the magnitude of a metric space was introduced by Leinster in [8] and developed in [10], [9], [11] and [16], but the magnitudes of familiar sets in Euclidean space are only understood in relatively few cases. In this paper we…
We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…
The dimension of a poset $P$, denoted $\dim(P)$, is the least positive integer $d$ for which $P$ is the intersection of $d$ linear extensions of $P$. The maximum dimension of a poset $P$ with $|P|\le 2n+1$ is $n$, provided $n\ge2$, and this…
For every integer $n$ with $n \geq 6$, we prove that the Boolean dimension of a poset consisting of all the subsets of $\{1,\dots,n\}$ equipped with the inclusion relation is strictly less than $n$.
The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…
Gradient boundedness up to the boundary for solutions to Dirichlet and Neumann problems for elliptic systems with Uhlenbeck type structure is established. Nonlinearities of possibly non-polynomial type are allowed, and minimal regularity on…
Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$…
We develop a powerful tool for embedding any tree poset $P$ of height $k$ in the Boolean lattice which allows us to solve several open problems in the area. We show that: * If $H$ is a family in $B_n$ with $|H|\ge (q-1+\varepsilon){n\choose…
We consider two generalizations of Pollack's uncertainty principle for M\"obius inversion to locally finite posets. The first generalization was previously studied by Goh. Here, we provide a simplified sufficient criterion for the…
We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…
Most of the existing methods for estimating the local intrinsic dimension of a data distribution do not scale well to high-dimensional data. Many of them rely on a non-parametric nearest neighbors approach which suffers from the curse of…
We introduce tree dimension and its leveled variant in order to measure the complexity of leaf sets in binary trees. We then provide a tight upper bound on the size of such sets using leveled tree dimension. This, in turn, implies both the…
Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…
In this paper we develop some combinatorial models for continuous spaces. In this spirit we study the approximations of continuous spaces by graphs, molecular spaces and coordinate matrices. We define the dimension on a discrete space by…
Dimension profiles were introduced in [8,11] to give a formula for the box-counting and packing dimensions of the orthogonal projections of a set $R^n$ onto almost all $m$-dimensional subspaces. However, these definitions of dimension…
The concept of metric dimension has applications in a variety of fields, such as chemistry, robotic navigation, and combinatorial optimization. We show bounds for graphs with $n$ vertices and metric dimension $\beta$. For Hamiltonian…
The intrinsic dimensionality refers to the ``true'' dimensionality of the data, as opposed to the dimensionality of the data representation. For example, when attributes are highly correlated, the intrinsic dimensionality can be much lower…
We produce a criterion for open sets in projective $n$-space over a separably closed field to have \'etale cohomological dimension bounded by $2n-3$. We use the criterion to exhibit a scheme for which \'etale cohomological dimension is…