English
Related papers

Related papers: On Periodic Decompositions and Nonexpansive Lines

200 papers

A d-dimensional configuration c : Z^d -> A is a coloring of the d-dimensional infinite grid by elements of a finite alphabet A \subseteq Z. The configuration c has an annihilator if a non-trivial linear combination of finitely many…

Discrete Mathematics · Computer Science 2023-01-18 Jarkko Kari

A complete characterization is given of the possible macroscopic deformations of periodic nonlinear affine unimode metamaterials constructed from rigid bars and pivots. The materials are affine in the sense that their macroscopic…

Materials Science · Physics 2015-06-05 Graeme Walter Milton

A long-standing conjecture of Podewski states that every minimal field is algebraically closed. It was proved by Wagner for fields of positive characteristic, but it remains wide open in the zero-characteristic case. We reduce Podewski's…

Logic · Mathematics 2013-12-03 Krzysztof Krupiński , Predrag Tanović , Frank O. Wagner

Nivat's conjecture is a long-standing open combinatorial problem. It concerns two-dimensional configurations, that is, maps $\mathbb Z^2 \rightarrow \mathcal A$ where $\mathcal A$ is a finite set of symbols. Such configurations are often…

Discrete Mathematics · Computer Science 2017-10-17 Michal Szabados

Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…

Optimization and Control · Mathematics 2013-06-04 Yifan Sun , Martin S. Andersen , Lieven Vandenberghe

This paper deals with periodic solutions of the Hamilton equation with many parameters. Theorems on global bifurcation of solutions with periods $2\pi/j,$ $j\in\mathbb{N},$ from a stationary point are proved. The Hessian matrix of the…

Classical Analysis and ODEs · Mathematics 2010-07-14 Wiktor Radzki

We study Nivat's conjecture on algebraic subshifts and prove that in some of them every low complexity configuration is periodic. This is the case in the Ledrappier subshift (the 3-dot system) and, more generally, in all two-dimensional…

Dynamical Systems · Mathematics 2018-06-20 Jarkko Kari , Etienne Moutot

The periodic tiling conjecture asserts that if a region $\Sigma\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was…

Combinatorics · Mathematics 2024-09-26 Jaume de Dios Pont , Jan Grebík , Rachel Greenfeld , Jose Madrid

A one-parameter deformation of a periodic bar-and-joint framework is expansive when all distances between joints increase or stay the same. In dimension two, expansive behavior can be fully explained through our theory of periodic…

Metric Geometry · Mathematics 2015-07-14 Ciprian S. Borcea , Ileana Streinu

In a recent article, we gave a full characterization of matrices that can be decomposed as a linear combination of two idempotents with prescribed coefficients. In this one, we use those results to improve on a recent theorem of V.…

Rings and Algebras · Mathematics 2010-05-26 Clément de Seguins Pazzis

We develop a stability theory for two-dimensional periodic traveling waves of general parabolic systems, possibly including conservation laws. In particular, we identify a diffusive spectral stability assumption and prove that it implies…

Analysis of PDEs · Mathematics 2025-08-07 L. Miguel Rodrigues , Aric Wheeler

In this paper, we establish that the space $ \mathbb{P}_p $ of all periodic function of fundamental period $ p $ can be expressed as a direct sum of the space $ \mathbb{P}_{p/2} $ of all periodic functions with fundamental period $ p/2 $…

General Mathematics · Mathematics 2025-07-15 Hailu Bikila Yadeta

In a series of four papers we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac12+\alpha)n$…

Combinatorics · Mathematics 2017-07-31 Jan Hladký , János Komlós , Diana Piguet , Miklós Simonovits , Maya J. Stein , Endre Szemerédi

A numerical semigroup is an additive subsemigroup of the natural numbers that contains zero and has finite complement. A numerical semigroup is irreducible if it cannot be written as an intersection of numerical semigroups properly…

Commutative Algebra · Mathematics 2026-02-03 Pedro Garcia-Sanchez , Christopher O'Neill

We obtain structural results on translational tilings of periodic functions in $\mathbb{Z}^d$ by finite tiles. In particular, we show that any level one tiling of a periodic set in $\mathbb{Z}^2$ must be weakly periodic (the disjoint union…

Classical Analysis and ODEs · Mathematics 2021-09-27 Rachel Greenfeld , Terence Tao

In this paper we address the characterization of the structure of condensed materials, periodic and non-periodic. Carrying out an extensive study of over 7000 different groundstate structures of a 2D lattice model of binary packing, we find…

Soft Condensed Matter · Physics 2026-05-21 Ian Douglass , Peter Harrowell

The Morse-Hedlund Theorem states that a bi-infinite sequence $\eta$ in a finite alphabet is periodic if and only if there exists $n\in\N$ such that the block complexity function $P_\eta(n)$ satisfies $P_\eta(n)\leq n$. In dimension two,…

Dynamical Systems · Mathematics 2013-07-02 Van Cyr , Bryna Kra

We present a theorem that allows to simplify linear stability analysis of periodic and quasiperiodic nonlinear regimes in N-particle mechanical systems (both conservative and dissipative) with different kinds of discrete symmetry. This…

Pattern Formation and Solitons · Physics 2009-11-11 G. M. Chechin , K. G. Zhukov

Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…

Information Theory · Computer Science 2023-05-10 W. Lu , X. Wu , X. W. Cao , G. J. Luo , X. P. Qin

We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control, PD0L systems for short. These systems give rise to a class of one-sided infinite sequences, called PD0L words. We…

Formal Languages and Automata Theory · Computer Science 2012-07-11 Joerg Endrullis , Dimitri Hendriks