English
Related papers

Related papers: Local Complexity of Delone Sets and Crystallinity

200 papers

For a well-studied family of domination-type problems, in bounded-treewidth graphs, we investigate whether it is possible to find faster algorithms. For sets $\sigma,\rho$ of non-negative integers, a $(\sigma,\rho)$-set of a graph $G$ is a…

Computational Complexity · Computer Science 2023-06-07 Jacob Focke , Dániel Marx , Fionn Mc Inerney , Daniel Neuen , Govind S. Sankar , Philipp Schepper , Philip Wellnitz

Let K \subset R^N be a convex body containing the origin. A measurable set G \subset R^N with positive Lebesgue measure is said to be uniformly K-dense if, for any fixed r > 0, the measure of G \cap (x + rK) is constant when x varies on the…

Metric Geometry · Mathematics 2013-08-06 Rolando Magnanini , Michele Marini

The situation of the decay of the metastable phase on the several types of heterogeneous centers is described analytically. The total number of heterogeneous centers is supposed to be equal for different types. This description decomposes…

Statistical Mechanics · Physics 2007-05-23 V. Kurasov

Let $R$ be a standard graded polynomial ring that is finitely generated over a field, and let $I$ be a homogenous prime ideal of $R$. Bhatt, Blickle, Lyubeznik, Singh, and Zhang examined the local cohomology of $R/I^t$, as $t$ grows…

Commutative Algebra · Mathematics 2020-05-26 Jennifer Kenkel

Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles…

Computational Geometry · Computer Science 2017-10-09 David Eppstein

For a given ring (domain) in $\overline{\mathbb{R}}^n$ we discuss whether its boundary components can be separated by an annular ring with modulus nearly equal to that of the given ring. In particular, we show that, for all $n\ge 3\,,$ the…

Complex Variables · Mathematics 2020-06-03 Anatoly Golberg , Toshiyuki Sugawa , Matti Vuorinen

In this paper we slightly improve the regularity theory for the so called optimal design problem. We first establish the uniform rectifiability of the boundary of the optimal set, for a larger class of minimizers, in any dimension. As an…

Optimization and Control · Mathematics 2025-05-29 Lorenzo Lamberti , Antoine Lemenant

Consider the partially ordered set on $[t]^n:=\{0,\dots,t-1\}^n$ equipped with the natural coordinate-wise ordering. Let $A(t,n)$ denote the number of antichains of this poset. The quantity $A(t,n)$ has a number of combinatorial…

Combinatorics · Mathematics 2023-10-20 Victor Falgas-Ravry , Eero Räty , István Tomon

We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…

Combinatorics · Mathematics 2025-02-18 Dhruv Mubayi , Jozsef Solymosi

It is well known that a spherically symmetric constant density static star, modeled as a perfect fluid, possesses a bound on its mass m by its radial size R given by 2m/R \le 8/9 and that this bound continues to hold when the energy density…

General Relativity and Quantum Cosmology · Physics 2009-10-31 Jemal Guven , Niall O' Murchadha

This paper investigates a local central limit theorem for a normalized sequence of random variables belonging to a fixed order Wiener chaos and converging to the standard normal distribution. We prove, without imposing any additional…

Probability · Mathematics 2026-01-13 Masahisa Ebina , Ivan Nourdin , Giovanni Peccati

The separation dimension of a hypergraph $G$ is the smallest natural number $d$ for which there is an embedding of $G$ into $\mathbb{R}^d$, such that any pair of disjoint edges is separated by some hyperplane normal to one of the axes. The…

Combinatorics · Mathematics 2021-09-01 Raphael Yuster

Defects arise when nematic liquid crystals are under topological constraints at the boundary. Recently the study of defects has drawn a lot of attention. In this paper, we investigate the relationship between two-dimensional defects and…

Soft Condensed Matter · Physics 2015-10-16 Yang Qu , Ying Wei , Pingwen Zhang

Assume that $\mathcal{P}$ is a topological property of a space $X$, then we say that $X$ is {\it dense-$\mathcal{P}$} if each dense subset of $X$ has the property $\mathcal{P}$. In this paper, we mainly discuss dense subsets of a space $X$,…

General Topology · Mathematics 2023-04-10 Fucai Lin , Qiyun Wu

Let $R=k[x_1,\dots,x_n]/I$ be a standard graded $k$-algebra where $k$ is a field of prime characteristic and let $J$ be a homogeneous ideal in $R$. Denote $(x_1,\dots,x_n)$ by $\mathfrak{m}$. We prove that there is a constant $C$…

Commutative Algebra · Mathematics 2015-12-02 Wenliang Zhang

The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…

Statistical Mechanics · Physics 2015-05-18 A. B. Hopkins , F. H. Stillinger , S. Torquato

Given a complete local (Noetherian) ring $T$, we find necessary and sufficient conditions on $T$ such that there exists a local domain $A$ with $|A| < |T|$ and $\widehat{A} = T$, where $\widehat{A}$ denotes the completion of $A$ with…

Commutative Algebra · Mathematics 2019-11-18 Erica Barrett , Emil Graf , S. Loepp , Kimball Strong , Sharon Zhang

We study the diametric problem (i.e., optimal anticodes) in the space of permutations under the Ulam distance. That is, let $S_n$ denote the set of permutations on $n$ symbols, and for each $\sigma, \tau \in S_n$, define their Ulam distance…

Combinatorics · Mathematics 2024-03-05 Pat Devlin , Leo Douhovnikoff

Suppose that $X$ be a nonempty set. Denote by $\mathcal{T}(X)$ the full transformation semigroup on $X$. For $\varnothing \neq Z\subseteq Y\subseteq X$, let $\mathcal{T}(X,Y,Z)=\{\alpha \in \mathcal{T}(X): Y\alpha \subseteq Z \}$. Then…

Group Theory · Mathematics 2023-06-02 Jiulin Jin , Taijie You

It is known that any open necklace with beads of $t$ types in which the number of beads of each type is divisible by $k$, can be partitioned by at most $(k-1)t$ cuts into intervals that can be distributed into $k$ collections, each…

Combinatorics · Mathematics 2021-12-30 Noga Alon , Dor Elboim , János Pach , Gábor Tardos
‹ Prev 1 8 9 10 Next ›