Related papers: A note on antichains in the continuous cube

In 3+1 dimensions there are anti-de quotients which are black holes with toroidal event horizons. By analytic continuation of the Schwarzschild-anti-de Sitter solution (and appropriate identifications) one finds two one parameter families…

We prove that for any nonlinear $f \in C^{1,\alpha}([0,1])$, the union of lines covering its graph has a Hausdorff dimension of at least $1+\alpha$, and this dimension bound is sharp. We then apply these geometric results to mathematical…

Let $a < b$ be multiplicatively independent integers, both at least $2$. Let $A,B$ be closed subsets of $[0,1]$ that are forward invariant under multiplication by $a$, $b$ respectively, and let $C := A\times B$. An old conjecture of…

An antinorm is a concave nonnegative homogeneous functional on a convex cone. It is shown that if the cone is polyhedral, then every antinorm has a unique continuous extension from the interior of the cone. The main facts of the duality…

The resistance between two nodes in some resistor networks has been studied extensively by mathematicians and physicists. Let $L_n$ be a linear hexagonal chain with $n$\, 6-cycles. Then identifying the opposite lateral edges of $L_n$ in…

We show that the endpoint set of a Suslinian chainable continuum must be zero-dimensional at some point. In particular, it cannot be homeomorphic to complete Erd\H{o}s space. This answers a question of Jerzy Krzempek.

We show that if the Banach-Mazur distance between an n-dimensional normed space X and ell infinity is at most 3/2, then there exist n+1 equidistant points in X. By a well-known result of Alon and Milman, this implies that an arbitrary…

We prove that, for every norm on $\mathbb{R}^d$ and every $E \subseteq \mathbb{R}^d$, the Hausdorff dimension of the distance set of $E$ with respect to that norm is at least $\dim_{\mathrm{H}} E - (d-1)$. An explicit construction follows,…

Erd\H{o}s and Rothschild asked to estimate the maximum number, denoted by H(N,C), such that every N-vertex graph with at least CN^2 edges, each of which is contained in at least one triangle, must contain an edge that is in at least H(N,C)…

We discuss the existence of vertex disjoint path coverings with prescribed ends for the $n$-dimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path…

The anti-forcing number of a connected graph $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching. In this paper, we show that the anti-forcing number of every…

For a reductive Lie algebra $\mathfrak h$ and a simple finite-dimensional $\mathfrak h$-module $V$, the set of weights of $V$, $P(V)$, has a natural poset structure. We consider antichains in the weight poset $P(V)$ and a certain operator…

The Falconer distinct distance problem asks for a compact set $E\subset\mathbb{R}^d$ how large its Hausdorff dimension needs to be to ensure that the Lebesgue measure of its distance set is positive. In this paper we consider the analogous…

We show that the class of multigraphs with at most $p$ connected components and bonds of size at most $k$ is well-quasi-ordered by edge contraction for all positive integers $p,k$. (A bond is a minimal non-empty edge cut.) We also…

This paper is a continuation of the paper [Got25] and studies Goldstern's principle, a principle about unions of continuum many null sets, further. The main result is that the Hausdorff measure version of Goldstern's principle for…

We show that in $\mathbb{R}^d$ there are purely unrectifiable sets of Hausdorff (and even box counting) dimension $d-1$ which are not tube null, settling a question of Carbery, Soria and Vargas, and improving a number of results by the same…

This paper gives a formula for the antichain generating polynomial $\mathcal{N}_{[k]\times Q}$ of the poset $[k]\times Q$, where $[k]$ is an arbitrary chain and $Q$ is any finite graded poset. When $Q$ specializes to be a connected…

We develop a connection between DP-colorings of $k$-uniform hypergraphs of order $n$ and coverings of $n$-dimensional Boolean hypercube by pairs of antipodal $(n-k)$-dimensional faces. Bernshteyn and Kostochka established that the lower…

We continue our investigation of the parameter space of families of polynomial skew products. Assuming that the base polynomial has a Julia set not totally disconnected and is neither a Chebyshev nor a power map, we prove that, near any…

We present the converse to a higher dimensional, scale-invariant version of a classical theorem of F. and M. Riesz. More precisely, for $n\geq 2$, for an ADR domain $\Omega\subset \re^{n+1}$ which satisfies the Harnack Chain condition plus…