Related papers: Optimal Embeddings of Posets in Hypercubes

A $(\beta,\epsilon)$-$\textit{hopset}$ is, informally, a weighted edge set that, when added to a graph, allows one to get from point $a$ to point $b$ using a path with at most $\beta$ edges ("hops") and length…

A collection of linear orders on $X$, say $\mathcal{L}$, is said to \emph{realize} a partially ordered set (or poset) $\mathcal{P} = (X, \preceq)$ if, for any two distinct $x,y \in X$, $x \preceq y$ if and only if $x \prec_L y$, $\forall L…

Given a graph $G$, the maximum size of an induced subgraph of $G$ each component of which is a star is called the edge open packing number, $\rho_{e}^{o}(G)$, of $G$. Similarly, the maximum size of an induced subgraph of $G$ each component…

We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…

In this paper we completely solve the problem of finding the (upper) approximation order with respect to the Kolmogorov, Gel'fand, and linear widths for the embedding of the Sobolev spaces $W^{\alpha,p}$ and $W_{0}^{\alpha,p}$ in the…

We study collective modes near the quantum critical point of a pair-density-wave (PDW) superconductor in 2+1 dimensions. The fate of gaps of various collective modes is investigated by functional renormalization. For incommensurate PDW…

The generalized Fitting height $h^*(G)$ of a finite group $G$ is the least number $h$ such that $\mathrm{F}_h^* (G) = G$, where $\mathrm{F}_{(0)}^* (G) = 1$, and $\mathrm{F}_{(i+1)}^*(G)$ is the inverse image of the generalized Fitting…

An induced subposet $(P_2,\le_2)$ of a poset $(P_1,\le_1)$ is a subset of $P_1$ such that for every two $X,Y\in P_2$, $X\le_2 Y$ if and only if $X\le_1 Y$. The Boolean lattice $Q_n$ of dimension $n$ is the poset consisting of all subsets of…

Binary embedding is the problem of mapping points from a high-dimensional space to a Hamming cube in lower dimension while preserving pairwise distances. An efficient way to accomplish this is to make use of fast embedding techniques…

In this article, we continue the study of the problem of $L^p$-boundedness of the maximal operator $M$ associated to averages along isotropic dilates of a given, smooth hypersurface $S$ of finite type in 3-dimensional Euclidean space. An…

Let $\pi:{\mathbb R}^n \to {\mathbb R}^d$ be any linear projection, let $A$ be the image of the standard basis. Motivated by Postnikov's study of postitive Grassmannians via plabic graphs and Galashin's connection of plabic graphs to slices…

Embedding-based representations in Euclidean space $\mathbb{R}^d$ are a cornerstone of modern machine learning, where a major goal is to use the \emph{smallest dimension} that faithfully captures data relations. In this work, we prove sharp…

Let $H := \begin{pmatrix} 1 & {\mathbf R} & {\mathbf R} \\ 0 & 1 &{\mathbf R} \\ 0 & 0 & 1 \end{pmatrix}$ denote the Heisenberg group with the usual Carnot-Carath\'eodory metric $d$. It is known (since the work of Pansu and Semmes) that the…

This paper introduces a new variant of hypercubes, which we call Z-cubes. The n-dimensional Z-cube $H_n$ is obtained from two copies of the (n-1)-dimensional Z-cube $H_{n-1}$ by adding a special perfect matching between the vertices of…

Optimal weighted Sobolev-Lorentz embeddings with homogeneous weights in open convex cones are established, with the exact value of the optimal constant. These embeddings are non-compact, and this paper investigates the structure of their…

One of possible cryptomorphic definitions of a partially ordered set (= a poset) $P$ on a non-empty finite basic set $N$ is in terms of the set ${\cal L}(P)$ of all its linear extensions, that is, in terms of the set of total orders of $N$…

We study one dimensional sets (Hausdorff dimension) lying in a Hilbert space. The aim is to classify subsets of Hilbert spaces that are contained in a connected set of finite Hausdorff length. We do so by extending and improving results of…

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…

We consider the poset of weighted partitions $\Pi_n^w$, introduced by Dotsenko and Khoroshkin in their study of a certain pair of dual operads. The maximal intervals of $\Pi_n^w$ provide a generalization of the lattice $\Pi_n$ of…

The problem of determining the maximum size $La(n,P)$ that a $P$-free subposet of the Boolean lattice $B_n$ can have, attracted the attention of many researchers, but little is known about the induced version of these problems. In this…