English
Related papers

Related papers: Local Complexity of Delone Sets and Crystallinity

200 papers

Let G be a graph with maximum degree \Delta whose vertex set is partitioned into parts V(G) = V_1 \cup ... \cup V_r. A transversal is a subset of V(G) containing exactly one vertex from each part V_i. If it is also an independent set, then…

Combinatorics · Mathematics 2007-06-15 Po-Shen Loh , Benny Sudakov

A growth mechanism for a perfect one-dimensional (1D) quasiperiodic structure is presented with a local covering rule. We use rectangular tiles with two different types of string decorations. The string position in a tile is allowed to move…

Mathematical Physics · Physics 2008-01-24 Hyeong-Chai Jeong

A growth model which describes the deposition of particles (or the growth of a rigid crystal) on a disordered substrate is investigated. The dynamic renormalization group is applied to the stochastic growth equation using the Martin, Sigga,…

Condensed Matter · Physics 2009-10-22 Yan-Chr Tsai , Yonathan Shapir

We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets (denoted IDENTIFYING CODE, (OPEN) LOCATING-DOMINATING SET and METRIC DIMENSION) of an interval or a permutation graph. In…

Discrete Mathematics · Computer Science 2017-07-17 Florent Foucaud , George B. Mertzios , Reza Naserasr , Aline Parreau , Petru Valicov

Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in which the weight of every edge is its length. It has long been conjectured that the dilation in T of any pair p, p \in P, which is the ratio of…

Computational Geometry · Computer Science 2010-06-03 Prosenjit Bose , Luc Devroye , Maarten Löffler , Jack Snoeyink , Vishal Verma

A $k$-dominating set is a set $D$ of nodes of a graph such that, for each node $v$, there exists a node $w \in D$ at distance at most $k$ from $v$. Our aim is the deterministic distributed construction of small $T$-dominating sets in time…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-05-04 Avery Miller , Andrzej Pelc

Let $A$ be a square random matrix of size $n$, with mean zero, independent but not identically distributed entries, with variance profile $S$. When entries are i.i.d. with unit variance, the spectral radius of $n^{-1/2}A$ converges to $1$…

Probability · Mathematics 2025-08-08 Yi Han

We generalize, and then use, a recently introduced formalism to study thermal fluctuations of atomic displacements in several two and three dimensional crystals. We study both close packed as well as open crystals with multi atom bases.…

Statistical Mechanics · Physics 2019-09-18 Pankaj Popli , Sayantani Kayal , Peter Sollich , Surajit Sengupta

A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of $[0,1]$ with measure greater than x contains a symmetric…

Combinatorics · Mathematics 2010-03-04 Greg Martin , Kevin O'Bryant

In this paper, we explain the regularity, projective dimension and depth of edge ideal of some classes of graphs in terms of invariants of graphs. We show that for a $C_5$-free vertex decomposable graph $G$, $\T{reg}(R/I(G))= c_G$, where…

Commutative Algebra · Mathematics 2017-01-24 Fahimeh Khosh-Ahang , Somayeh Moradi

Simple random coverage models, well studied in Euclidean space, can also be defined on a general compact metric space. By analogy with the geometric models, and with the discrete coupon collector's problem and with cover times for finite…

Probability · Mathematics 2021-02-01 David J. Aldous

Let F be a family of subsets of {1,2,...,n}. The width-degree of an element x in at least one member of F is the width of the family {U in F | x in U}. If F has maximum width-degree at most k, then F is locally k-wide. Bounds on the size of…

Combinatorics · Mathematics 2016-09-06 Emanuel Knill

A tie-point of a compact space is analogous to a cut-point: the complement of the point falls apart into two relatively clopen non-compact subsets. Set-theoretically a tie-point of N* is an ultrafilter whose dual maximal ideal can be…

General Topology · Mathematics 2018-01-09 Alan Dow , Saharon Shelah

Let $L_n$ be a line graph with $n$ edges and $\F(L_n)$ the facet ideal of its matching complex. In this paper, we provide the irreducible decomposition of $\F(L_n)$ and some exact formulas for the projective dimension and the regularity of…

Commutative Algebra · Mathematics 2021-08-11 Guangjun Zhu , Hong Wang , Yijun Cui

An $\epsilon$-net theorem for a hypergraph upper bounds the minimum size of a vertex set that pierces all $\epsilon$-heavy hyperedges. A $(p,2)$-theorem bounds from above the minimum size of a vertex set that pierces all hyperedges, in…

Combinatorics · Mathematics 2026-01-05 Chaya Keller , Shakhar Smorodinsky

We generalize the shape optimization problem for the existence of stable equilibrium configurations of nematic and cholesteric liquid crystal drops surrounded by an isotropic solution to include a broader family of admissible domains with…

Analysis of PDEs · Mathematics 2024-08-29 Alessandro Giacomini , Silvia Paparini

An ideal is a nonempty collection of subsets closed under heredity and finite additivity. The aim of this paper is to unify some weak separation properties via topological ideals. We concentrate our attention on the separation axioms…

General Topology · Mathematics 2007-05-23 Francisco G. Arenas , Julian Dontchev , Maria Luz Puertas

We characterize embedded $\C^1$ hypersurfaces of $\R^n$ as the only locally closed sets with continuously varying flat tangent cones whose measure-theoretic-multiplicity is at most $m<3/2$. It follows then that any (topological)…

Algebraic Geometry · Mathematics 2013-09-17 Mohammad Ghomi , Ralph Howard

Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…

Computational Geometry · Computer Science 2023-11-01 Sariel Har-Peled , Elfarouk Harb

A regular graph $G = (V,E)$ is an $(\varepsilon,\gamma)$ small-set expander if for any set of vertices of fractional size at most $\varepsilon$, at least $\gamma$ of the edges that are adjacent to it go outside. In this paper, we give a…

Computational Complexity · Computer Science 2022-11-18 Mark Braverman , Dor Minzer