Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1402.4912

Balanced simplices

Jonathan Chappelon
View original source ↗Read source document ↗Export metadata ↓

Abstract

An additive cellular automaton is a linear map on the set of infinite multidimensional arrays of elements in a finite cyclic group $\mathbb{Z}/m\mathbb{Z}$. In this paper, we consider simplices appearing in the orbits generated from arithmetic arrays by additive cellular automata. We prove that they are a source of balanced simplices, that are simplices containing all the elements of $\mathbb{Z}/m\mathbb{Z}$ with the same multiplicity. For any additive cellular automaton of dimension $1$ or higher, the existence of infinitely many balanced simplices of $\mathbb{Z}/m\mathbb{Z}$ appearing in such orbits is shown, and this, for an infinite number of values $m$. The special case of the Pascal cellular automata, the cellular automata generating the Pascal simplices, that are a generalization of the Pascal triangle into arbitrary dimension, is studied in detail.

Explore related subjects

math.COmath.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonathan Chappelon. 2016-04-06. Balanced simplices. https://doi.org/10.1016/j.aam.2014.09.007

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↗