Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1504.06087

A divisibility result on combinatorics of generalized braids

Loïc Foissy·Jean Fromentin
View original source ↗Read source document ↗Export metadata ↓

Abstract

For every finite Coxeter group $Γ$, each positive braids in the corresponding braid group admits a unique decomposition as a finite sequence of elements of $Γ$, the so-called Garside-normal form.The study of the associated adjacency matrix $Adj(Γ)$ allows to count the number of Garside-normal form of a given length.In this paper we prove that the characteristic polynomial of $Adj(B_n)$ divides the one of $Adj(B_{n+1})$. The key point is the use of a Hopf algebra based on signed permutations. A similar result was already known for the type $A$. We observe that this does not hold for type $D$. The other Coxeter types ($I$, $E$, $F$ and $H$) are also studied.

Explore related subjects

math.COmath.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Loïc Foissy, Jean Fromentin. 2015-04-23. A divisibility result on combinatorics of generalized braids. https://arxiv.org/abs/1504.06087

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↗