English
Related papers

Related papers: Cantor sets in higher dimensions II: Optimal dimen…

200 papers

Constant weight codes (CWCs) and constant composition codes (CCCs) are two important classes of codes that have been studied extensively in both combinatorics and coding theory for nearly sixty years. In this paper we show that for {\it…

Combinatorics · Mathematics 2024-01-23 Miao Liu , Chong Shangguan

In this paper we investigate boundedness and volumes of generalised pairs, and give applications to usual pairs especially to a class of pairs that we call stable log minimal models. Fixing the dimension and a DCC set controlling…

Algebraic Geometry · Mathematics 2021-04-06 Caucher Birkar

We prove that for $d\geq 3$, the 1-skeleton of any $(d-1)$-dimensional doubly Cohen Macaulay (abbreviated 2-CM) complex is generically $d$-rigid. This implies the following two corollaries (by Kalai and Lee respectively): Barnette's lower…

Combinatorics · Mathematics 2008-09-05 Eran Nevo

The limiting slow dynamics of slow-fast, piecewise-linear, continuous systems of ODEs occurs on critical manifolds that are piecewise-linear. At points of non-differentiability, such manifolds are not normally hyperbolic and so the…

Dynamical Systems · Mathematics 2018-01-16 David J. W. Simpson

Given $l>2\nu>2d\geq 4$, we prove the persistence of a Cantor--family of KAM tori of measure $O(\varepsilon^{1/2-\nu/l})$ for any non--degenerate nearly integrable Hamiltonian system of class $C^l(\mathscr D\times\mathbb{T}^d)$, where…

Dynamical Systems · Mathematics 2020-04-06 Comlan Edmond Koudjinan

In this paper, we give upper bounds on the sizes of $(d, L)$ list-decodable codes in the Hamming metric space from covering codes with the covering radius smaller than or equal to $d$. When the list size $L$ is $1$, this gives many new…

Information Theory · Computer Science 2023-01-25 Hao Chen , Longjiang Qu , Chengju Li , Shanxiang Lyu , Liqing Xu

We consider compact hyperbolic Coxeter polytopes whose Coxeter diagram contains a unique dotted edge. We prove that such a polytope in d-dimensional hyperbolic space has at most d+3 facets. In view of results of Lann\'er, Kaplinskaja,…

Metric Geometry · Mathematics 2022-09-13 Anna Felikson , Pavel Tumarkin

We construct a function that lies in $L^p(\mathbb{R}^d)$ for every $p \in (1,\infty]$ and whose Fourier transform has no Lebesgue points in a Cantor set of full Hausdorff dimension. We apply Kova\v{c}'s maximal restriction principle to show…

Classical Analysis and ODEs · Mathematics 2020-01-29 Constantin Bilz

In 1954 Marstrand proved that if K is a subset of R^2 with Hausdorff dimension greater than 1, then its one-dimensional projection has positive Lebesgue measure for almost-all directions. In this article, we give a combinatorial proof of…

Dynamical Systems · Mathematics 2020-04-21 Yuri Lima , Carlos Gustavo Moreira

We have previously used inverse statistical-mechanical methods to optimize isotropic pair interactions with multiple extrema to yield low-coordinated crystal classical ground states (e.g., honeycomb and diamond structures) in d-dimensional…

Statistical Mechanics · Physics 2010-11-13 Etienne Marcotte , Frank H. Stillinger , Salvatore Torquato

For metric spaces, the doubling property, the uniform disconnectedness, and the uniform perfectness are known as quasi-symmetric invariant properties. The David-Semmes uniformization theorem states that if a compact metric space satisfies…

Metric Geometry · Mathematics 2019-02-11 Yoshito Ishiki

We improve the decoupling exponent for functions with spectrum inside AD-regular collections of arcs on the parabola. We achieve this by incorporating recent Szemer\'{e}di--Trotter-type estimates into the bootstrapping argument from…

Classical Analysis and ODEs · Mathematics 2026-05-26 Ciprian Demeter , Yuqiu Fu

A uniform tight frame of N vectors for a d dimensional space is correlation minimizing if among all such frames it is as "nearly" orthogonal as possible, i.e., it minimizes the maximal inner product of unequal vectors. In this paper we…

Functional Analysis · Mathematics 2015-03-31 Grant Getzelman , Nicole L. Leonhard , Vern I. Paulsen

We prove that a general complete intersection of dimension $n$, codimension $c$ and type $d_1, \dots, d_c$ in $\mathbb{P}^N$ has ample cotangent bundle if $c \geq 2n-2$ and the $d_i$'s are all greater than a bound that is $O(1)$ in $N$ and…

Algebraic Geometry · Mathematics 2020-02-05 Izzet Coskun , Eric Riedl

It is proved that the class of separable Rosenthal compacta on the Cantor set having a uniformly bounded dense sequence of continuous functions, is strongly bounded.

Logic · Mathematics 2008-05-15 Pandelis Dodos

This paper continues the study of the structure of finite intersections of general multiplicative translates $\mathcal{C}(M_1,\ldots,M_n)=\frac{1}{M_1}\Sigma_{3,\bar{2}}\cap\cdots\cap\frac{1}{M_n}\Sigma_{3,\bar{2}}$ for integers $1\leq…

Number Theory · Mathematics 2018-05-08 William C. Abram , Artem Bolshakov , Jeffrey C. Lagarias

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…

Combinatorics · Mathematics 2019-11-12 Sascha Kurz , Reinhard Laue

In \cite{ZW}, the notion of homogenous perfect set as a generalization of Cantor type sets is introduced. Their Hausdorff, lower box-counting, upper box-counting and packing dimensions are studied in \cite{ZW} and \cite{WW}. In this paper,…

Complex Variables · Mathematics 2014-01-14 Yingqing Xiao

A family of axis-aligned boxes in $\er^d$ is \emph{$k$-neighborly} if the intersection of every two of them has dimension at least $d-k$ and at most $d-1$. Let $n(k,d)$ denote the maximum size of such a family. It is known that $n(k,d)$ can…

Combinatorics · Mathematics 2023-03-06 Noga Alon , Jarosław Grytczuk , Andrzej P. Kisielewicz , Krzysztof Przesławski

We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is…

Combinatorics · Mathematics 2019-06-03 Francisco Criado , Andrew Newman
‹ Prev 1 8 9 10 Next ›