English
Related papers

Related papers: On the Multiple Packing Densities of Triangles

200 papers

We obtain exact densities of contractible and non-contractible loops in the O(1) model on a strip of the square lattice rolled into an infinite cylinder of finite even circumference $L$. They are also equal to the densities of critical…

Mathematical Physics · Physics 2021-04-14 A. M. Povolotsky

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

Complex Variables · Mathematics 2025-06-26 Stéphane Charpentier , Konstantinos Maronikolakis

The $\textit{volume density}$ of a hyperbolic link $K$ is defined to be the ratio of the hyperbolic volume of $K$ to the crossing number of $K$. We show that there are sequences of non-alternating links with volume density approaching…

Geometric Topology · Mathematics 2015-07-09 Stephan D. Burton

Let $G$ be an LCA group, $H$ a closed subgroup, $\varGamma$ the dual group of $G$ and $\mu$ be a regular finite non-negative Borel measure on $\varGamma$. We give some necessary and sufficient conditions for the density of the set of…

Functional Analysis · Mathematics 2017-09-12 Juan Miguel Medina , Lutz Peter Klotz , Manfred Riedel

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

This paper studies the basic K-theoretic properties of a triangulated persistence category (TPC). This notion was introduced in our earlier papers on triangulation, persistence, and Fukaya categories (arXiv:2304.01785 and arXiv:2104.12258)…

Symplectic Geometry · Mathematics 2024-09-05 Paul Biran , Octav Cornea , Jun Zhang

Let $f(z)=\sum_{n=1}^\infty a(n)q^n\in S^{\text{new}}_ k (\Gamma_0(N))$ be a newform with squarefree level $N$ that does not have complex multiplication. For a prime $p$, define $\theta_p\in[0,\pi]$ to be the angle for which $a(p)=2p^{( k…

Number Theory · Mathematics 2020-04-13 Jeremy Rouse , Jesse Thorner

We show that tensor products of $k$ gradients of harmonic functions, with $k$ at least three, are dense in $C(\overline{\Omega})$, for any bounded domain $\Omega$ in dimension 3 or higher. The bulk of the argument consists in showing that…

Analysis of PDEs · Mathematics 2023-05-10 Cătălin I. Cârstea , Ali Feizmohammadi

Folding of the triangular lattice in a discrete three-dimensional space is investigated numerically. Such ``discrete folding'' has come under through theoretical investigation, since Bowick and co-worker introduced it as a simplified model…

Statistical Mechanics · Physics 2009-11-10 Yoshihiro Nishiyama

Let $\Delta_k(n)$ denote the simplicial complex of $(k+1)$-crossing-free subsets of edges in $\binom{[n]}{2}$. Here $k,n\in \mathbb N$ and $n\ge 2k+1$. Jonsson (2003) proved that (neglecting the short edges that cannot be part of any…

Combinatorics · Mathematics 2025-05-13 Luis Crespo Ruiz , Francisco Santos

Call a permutation $k$-inflatable if the sequence of its tensor products with uniform random permutations of increasing lengths has uniform $k$-point pattern densities. Previous work has shown that nontrivial $k$-inflatable permutations do…

Combinatorics · Mathematics 2021-01-13 Tanya Khovanova , Eric Zhang

A new ATSP2K module is presented for evaluating the electron density function of any multiconfiguration Hartree-Fock or configuration interaction wave function in the non relativistic or relativistic Breit-Pauli approximation. It is first…

Atomic Physics · Physics 2015-05-13 A. Borgoo , O. Scharf , G. Gaigalas , M. Godefroid

We consider circle packings in the plane with circles of sizes $1$, $r\simeq 0.834$ and $s\simeq 0.651$. These sizes are algebraic numbers which allow a compact packing, that is, a packing in which each hole is formed by three mutually…

Computational Geometry · Computer Science 2019-12-06 Thomas Fernique

This is the fifth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

This article considers the relation between the spanning properties of lattice orbits of discrete series representations and the associated lattice co-volume. The focus is on the density theorem, which provides a trichotomy characterizing…

Functional Analysis · Mathematics 2021-10-28 José Luis Romero , Jordy Timo van Velthoven

The polygonal distributions are a class of distributions that can be defined via the mixture of triangular distributions over the unit interval. The class includes the uniform and trapezoidal distributions, and is an alternative to the beta…

Methodology · Statistics 2017-01-18 Hien D Nguyen , Geoffrey J McLachlan

Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of…

Geometric Topology · Mathematics 2011-03-04 Felix Effenberger

This paper proves the following statement: {\it If a convex body can form a twofold translative tiling in $\mathbb{E}^3$, it must be a parallelohedron.} In other words, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedron,…

Metric Geometry · Mathematics 2021-06-30 Mei Han , Qi Yang , Kirati Sriamorn , Chuanming Zong

The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the…

Computational Geometry · Computer Science 2007-05-23 Jeff Erickson

We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…

Computational Geometry · Computer Science 2010-07-22 Oswin Aichholzer , Franz Aurenhammer , Erik D. Demaine , Ferran Hurtado , Pedro Ramos , Jorge Urrutia
‹ Prev 1 3 4 5 6 7 10 Next ›