Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1002.1089

$SL_k$-Tiling of the Plane

Francois Bergeron·Christophe Reutenauer
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study properties of (bi-infinite) arrays having all adjacent $k\times k$ adjacent minors equal to one. If we further add the condition that all adjacent $(k-1)\times (k-1)$ minors be nonzero, then these arrays are necessarily of rank $k$. It follows that we can explicit construct all of them. Several nice properties are made apparent. In particular, we revisit, with this perspective, the notion of frieze patterns of Coxeter. This shed new light on their properties. A connexion is also established with the notion of $T$-systems of Statistical Physics.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Francois Bergeron, Christophe Reutenauer. 2010-02-04. $SL_k$-Tiling of the Plane. https://arxiv.org/abs/1002.1089

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗