English
Related papers

Related papers: Polygonal ${\mathbb Z}^2$-subshifts

200 papers

Let $X$ be a (real or complex) infinite dimensional linear space. We establish conditions on a homogeneous polynomial $P$ on $X$ so that, if $W$ is any finite dimensional subspace of $X$ on which $P$ vanishes, then $P$ vanishes on an…

Functional Analysis · Mathematics 2024-07-18 Mikaela Aires , Geraldo Botelho

We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…

Mathematical Physics · Physics 2015-06-26 Saugata Ghosh

This is a study of the construction of particular regular sub-n-gons T in regular n-gons P using a special system of chords of P. In particular, some of these sub-n-gons have areas which are integer divisors of the area of the given n-gon…

History and Overview · Mathematics 2026-03-03 James M Parks

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…

Dynamical Systems · Mathematics 2020-09-14 Ville Salo

We study geometrical clues of a rigidity transition due to the emergence of a system-spanning state of self stress in under-constrained systems of individual polygons and spring networks constructed from such polygons. When a polygon with…

Soft Condensed Matter · Physics 2022-11-30 M. C. Gandikota , Amanda Parker , J. M. Schwarz

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

Optimization and Control · Mathematics 2017-01-03 Alexander Weber , Gunther Reissig

We show that after mapping each element of a set of second class constraints to the surface of the other ones, half of them form a subset of abelian first class constraints. The explicit form of the map is obtained considering the most…

High Energy Physics - Theory · Physics 2009-11-07 F. Loran

Let $V$ be a left vector space over a division ring and let ${\mathcal P}(V)$ be the associated projective space. We describe all finite subsets $X\subset V$ such that every permutation on $X$ can be extended to a linear automorphism of $V$…

Group Theory · Mathematics 2012-06-28 Mark Pankov

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

Discrete Mathematics · Computer Science 2014-05-26 Samy Ait-Aoudia , Roland Jegou , Dominique Michelucci

Convex polytopes are convex hulls of point sets in the $n$-dimensional space $\E^n$ that generalize 2-dimensional convex polygons and 3-dimensional convex polyhedra. We concentrate on the class of $n$-dimensional polytopes in $\E^n$ called…

Quantum Physics · Physics 2010-12-15 Colin Wilmott , Hermann Kampermann , Dagmar Bruss

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

Classical Analysis and ODEs · Mathematics 2018-03-08 José Ginés Espín Buendía , Víctor Jiménez López

$\lambda$-graph systems are labeled Bratteli diagram with shift operations. They present subshifts. Their matrix presentations are called symbolic matrix systems. We define skew products of $\lambda$-graph systems and study extensions of…

Dynamical Systems · Mathematics 2016-05-03 Kengo Matsumoto

A set of vertices X of a graph G is convex if it contains all vertices on shortest paths between vertices of X. We prove that for fixed p, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial…

Combinatorics · Mathematics 2015-09-17 Luciano Grippo , Martín Matamala , Martín Safe , Maya Stein

Let $X$ be a $2$-dimensional subshift of finite type generated by a finite set of forbidden blocks (of finite size). We give an algorithm for generating the elements of the shift space using sequence of finite matrices (of increasing size).…

Dynamical Systems · Mathematics 2019-02-06 Puneet Sharma , Dileep Kumar

We study the cohomology of symbolic dynamical systems called homshifts: they are the nearest-neighbour $\mathbb{Z}^d$ shifts of finite type whose adjacency rules are the same in every direction. Building on the work of Klaus Schmidt…

Dynamical Systems · Mathematics 2025-10-22 Nishant Chandgotia , Silvère Gangloff , Benjamin Hellouin de Menibus , Piotr Oprocha

We classify hyperbolic polynomials in two real variables that admit a transitive action on some component of their hyperbolic level sets. Such surfaces are called special homogeneous surfaces, and they are equipped with a natural Riemannian…

Differential Geometry · Mathematics 2024-12-11 David Lindemann , Andrew Swann

The aim of this article is to show the existence, and also give an explicit construction, of infinite sets of orthogonal exponentials for certain families of convex polytopes which include simple-rational polytopes and also non simple…

Combinatorics · Mathematics 2019-09-19 Yehonatan Salman

Consider the Dirichlet-type space on the bidisk consisting of holomorphic functions $f(z_1,z_2):=\sum_{k,l\geq 0}a_{kl}z_1^kz_2^l$ such that $\sum_{k,l\geq 0}(k+1)^{\alpha_1} (l+1)^{\alpha_2}|a_{kl}|^2 <\infty.$ Here the parameters…

Complex Variables · Mathematics 2015-12-16 Greg Knese , Lukasz Kosinski , Thomas J. Ransford , Alan Sola

We consider uniformly strongly elliptic systems of the second order with bounded coefficients. First, sufficient conditions for the invariance of convex bodies obtained for linear systems without zero order term in bounded domains and…

Analysis of PDEs · Mathematics 2014-12-09 Gershon Kresin , Vladimir Maz'ya

Automated program verification often proceeds by exhibiting inductive invariants entailing the desired properties.For numerical properties, a classical class of invariants is convex polyhedra: solution sets of system of linear…

Programming Languages · Computer Science 2018-05-16 David Monniaux