English
Related papers

Related papers: A stability theorem on cube tessellations

200 papers

We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…

Dynamical Systems · Mathematics 2025-08-06 Marcelo P. Santos , Leon D. da Silva

In intuitive physics the process of stacking cubes has become a paradigmatic, canonical task. Even though it gets employed in various shades and complexities, the very fundamental setting with two cubes has not been thoroughly investigated.…

Human-Computer Interaction · Computer Science 2025-09-05 Nikolai Bahr , Christoph Zetzsche

We prove that there exist positive constants $C$ and $c$ such that for any integer $d \ge 2$ the set of ${\mathbf x}\in [0,1)^d$ satisfying $$ cN^{1/2}\le \left|\sum^N_{n=1}\exp\left (2 \pi i \left (x_1n+\ldots+x_d n^d\right)\right)…

Number Theory · Mathematics 2020-11-19 Changhao Chen , Bryce Kerr , James Maynard , Igor Shparlinski

We are studying $d$-dimensional geometric problems that have algorithms with $1-1/d$ appearing in the exponent of the running time, for example, in the form of $2^{n^{1-1/d}}$ or $n^{k^{1-1/d}}$. This means that these algorithms perform…

Data Structures and Algorithms · Computer Science 2016-12-06 Dániel Marx , Anastasios Sidiropoulos

It is known that the $n$-dimensional hypercube $Q_n,$ for $n$ even, has a decomposition into $k$-cycles for $k=n, 2n,$ $2^l$ with $2 \leq l \leq n.$ In this paper, we prove that $Q_n$ has a decomposition into $2^mn$-cycles for $n \geq 2^m.$…

Combinatorics · Mathematics 2018-04-05 S. A. Tapadia , B. N. Waphare , Y. M. Borse

Let $\Gamma_d$ be the largest constant such that every finite collection of cubes in $\mathbb{R}^d$ whose sides are parallel to the coordinate axes admits a disjoint sub-collection occupying a fraction $\Gamma_d$ of its volume. Vitali's…

Classical Analysis and ODEs · Mathematics 2025-10-09 Gian Maria Dall'Ara

This paper concerns stability functions for Dynkin quivers, in the generality introduced by Rudakov. We show that relatively few inequalities need to be satisfied for a stability function to be totally stable (i.e. to make every…

Representation Theory · Mathematics 2024-07-16 Yariana Diaz , Cody Gilbert , Ryan Kinser

Let X be a real normed vector space and dim X \ge 2. Let d>0 be a fixed real number. We prove that if x,y \in X and ||x-y||/d is a rational number then there exists a finite set {x,y} \subseteq S(x,y) \subseteq X with the following…

Functional Analysis · Mathematics 2007-05-23 Apoloniusz Tyszka

For a graph $G$, let Conf$(G,n)$ denote the classical configuration space of $n$ labelled points in $G$. Abrams introduced a cubical complex, denoted here by DConf$(G,n)$, sitting inside Conf$(G,n)$ as a strong deformation retract provided…

Algebraic Topology · Mathematics 2026-01-23 Omar Alvarado-Garduño , Jesús González

For any natural number $d$ and positive number $\varepsilon$, we present a point set in the $d$-dimensional unit cube $[0,1]^d$ that intersects every axis-aligned box of volume greater than $\varepsilon$. These point sets are very easy to…

Computational Geometry · Computer Science 2017-09-12 David Krieg

To investigate the attenuation of turbulence in a periodic cube due to the addition of spherical solid particles, we conduct direct numerical simulations using an immersed boundary method with resolving flow around each particle. Numerical…

Fluid Dynamics · Physics 2022-10-19 Sunao Oka , Susumu Goto

We study $n$-dimensional matrices with $\{0,1\}$-entries ($n$-cubes) such that all their $2$-dimensional slices are incidence matrices of symmetric designs. A known construction of these objects obtained from difference sets is generalized…

Combinatorics · Mathematics 2025-09-30 Vedran Krčadinac , Mario Osvin Pavčević , Kristijan Tabak

This paper derives two stabilizability theorems for a basic class of discrete-time nonlinear systems with multiple unknown parameters. First, we claim that a discrete-time multi-parameter system is stabilizable if its nonlinear growth rate…

Optimization and Control · Mathematics 2020-07-23 Zhaobo Liu , Chanying Li

The Kneser-Poulsen conjecture says that if a finite collection of balls in a d-dimensional Euclidean space is rearranged so that the distance between each pair of centers does not get smaller, then the volume of the union of these balls…

Metric Geometry · Mathematics 2013-10-28 Igors Gorbovickis

We investigate entropy minimization problems for quantum states subject to convex block-separable constraints. Our principal result is a quantitative stability theorem: under a natural confining (fixed-support) hypothesis, if a state has…

Quantum Physics · Physics 2026-01-21 Hassan Nasreddine

For any $\theta, \omega > 1/2$ we prove that, if any $d$-pseudotrajectory of length $\sim 1/d^{\omega}$ of a diffeomorphism $f\in C^2$ can be $d^{\theta}$-shadowed by an exact trajectory, then $f$ is structurally stable. Previously it was…

Dynamical Systems · Mathematics 2015-08-05 Sergey Tikhomirov

We investigate the function $d_\mathbf{A}(n)$, which gives the size of a least size generating set for $\mathbf{A}^n$, in the case where $\mathbf{A}$ has a cube term. We show that if $\mathbf{A}$ has a $k$-cube term and $\mathbf{A}^k$ is…

Rings and Algebras · Mathematics 2016-02-04 Keith A. Kearnes , Emil W. Kiss , Agnes Szendrei

We solve the problem of existence of perfect codes in the Doob graph. It is shown that 1-perfect codes in the Doob graph D(m,n) exist if and only if 6m+3n+1 is a power of 2; that is, if the size of a 1-ball divides the number of vertices.…

Information Theory · Computer Science 2022-02-21 Denis S. Krotov

Let $\mathcal A_N$ to be $N$ points in the unit cube in dimension $ d$, and consider the Discrepency function D_N(\vec x) \coloneqq \sharp \mathcal A_N \cap [\vec 0,\vec x)-N \abs{[\vec 0,\vec x)} Here, $ \vec x= (x_1 ,...c, x_d)$ and $[…

Number Theory · Mathematics 2007-12-03 Michael T Lacey

Let L be a compact convex set in R^n, and let 1 <= d <= n-1. The set L is defined to be d-decomposable if L is a direct Minkowski sum (affine Cartesian product) of two or more convex bodies each of dimension at most d. A compact convex set…

Metric Geometry · Mathematics 2009-05-25 Daniel A. Klain
‹ Prev 1 4 5 6 7 8 10 Next ›