相关论文: A Simple Proof of Thue's Theorem on Circle Packing

Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…

In this paper, we prove a fine condensation theorem. This is quite similar to condensation theorems for pure extender mice in the literature, except that condensation for iteration strategies has been added to the mix.

Recently, Lai and Rohatgi discovered a shuffling theorem for lozenge tilings of doubly-dented hexagons, which generalized the earlier work of Ciucu. Later, Lai proved an analogous theorem for centrally symmetric tilings, which generalized…

We study the optimal packing of hard spheres in an infinitely long cylinder, using simulated annealing, and compare our results with the analogous problem of packing disks on the unrolled surface of a cylinder. The densest structures are…

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

We present a generalization of Descartes' theorem for the family of polytopal sphere packings arising from uniform polytopes. The corresponding quadratic equation is expressed in terms of geometric invariants of uniform polytopes which are…

We provide a counterexample to a conjecture by B. Connelly about density of circle packings

The purpose of this note is to clarify some details in McDuff and Segal's proof of the group-completion theorem and to generalize both this and the homology fibration criterion of McDuff to homology with twisted coefficients. This will be…

Goodwillie's proof of the Blakers-Massey Theorem for $n$-cubes relies on a lemma whose proof invokes transversality. The rest of his proof follows from general facts about cubes of spaces and connectivities of maps. We present a purely…

A toy model of particles packings is presented, which consists in arranging hexagons on a triangular lattice according to local stability rules. The number of stable packings is analytically computed and found to grow exponentially with the…

We prove a central limit theorem (CLT) for the number of joint orbits of random tuples of commuting permutations. In the uniform sampling case this generalizes the classic CLT of Goncharov for the number of cycles of a single random…

Let $K$ be a number field of degree $d\geq 3$ and fix $s$ multiplicatively independent algebraic integers $\gamma_1, \dots, \gamma_s \in K^*$ that fulfil some technical requirements, which can be vastly simplified to $\mathbb{Q}$-linearly…

In this work we propose a heuristic algorithm for the layout optimization for disks installed in a rotating circular container. This is a unequal circle packing problem with additional balance constraints. It proved to be an NP-hard…

We prove that for any discrete curvature satisfying Gauss-Bonnet formula, there exist a unique up to scaling inversive distance circle packing in the discrete conformal equivalent class, whose polyhedral metric meets the target curvature.…

We prove a result concerning the spreading of weighted Fekete points in the plane.

In this paper a generalized topological central point theorem is proved for maps of a simplex to finite-dimensional metric spaces. Similar generalizations of the Tverberg theorem are considered.

We present a symmetry result regarding stationary solutions of the 2D Euler equations in a disk. We prove that in a disk, a steady flow with only one stagnation point and tangential boundary conditions is a circular flow, which confirms a…

Originally, tangles were invented as an abstract tool in mathematical graph theory to prove the famous graph minor theorem. In this paper, we showcase the practical potential of tangles in machine learning applications. Given a collection…

The Central Limit Theorem for Iterated Functions Systems on the circle is proved. We study also ergodicity of such systems.

This note is devoted to show a simple proof of a tight lower bound of the parameterized compact set packing problem, based on ETH.