Related papers: From i-boxes to signed words
We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…
We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us on the one hand to obtain enumerations connecting products of hook lengths and vectors of integers. This…
We consider properties of the box polynomials, a one variable polynomial defined over all integer partitions $\lambda$ whose Young diagrams fit in an $m$ by $n$ box. We show that these polynomials can be expressed by the finite difference…
We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…
We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments. We give an algorithm constructing such a bijection.
Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the other hand, if the letters are carried as labels on nodes…
We study the cluster algebras arising from cluster tubes with rank bigger than $1$. Cluster tubes are $2-$Calabi-Yau triangulated categories which contain no cluster tilting objects, but maximal rigid objects. Fix a certain maximal rigid…
The k-means algorithm is a partitional clustering method. Over 60 years old, it has been successfully used for a variety of problems. The popularity of k-means is in large part a consequence of its simplicity and efficiency. In this paper…
Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k-set agreement. Among all…
We give a brief account of a construction called tokens here, which is significant in algebra, analysis, combinatorics, and physics. Tokens allow to express a semigroup on one set via a semigroup convolution on another set. Therefore tokens…
A reduced word of a permutation $w$ is a minimal length expression of $w$ as a product of simple transpositions. We examine the computational complexity, formulas and (randomized) algorithms for their enumeration. In particular, we prove…
We compute the K-theory of the C*-algebra of symmetric words in two universal unitaries. This algebra is the fixed point C*-algebra for the order-two automorphism of the full C*-algebra of the free group on two generators which switches the…
A quiver is an oriented graph. Quiver mutation is an elementary operation on quivers. It appeared in physics in Seiberg duality in the nineties and in mathematics in the definition of cluster algebras by Fomin-Zelevinsky in 2002. We show,…
The word problem for an arbitrary associative Rota-Baxter algebra is solved. This leads to a noncommutative generalization of the classical Spitzer identities. Links to other combinatorial aspects, particularly of interest in physics, are…
K-fold cross-validation is a widely used tool for assessing classifier performance. The reproducibility crisis faced by artificial intelligence partly results from the irreproducibility of reported k-fold cross-validation-based performance…
Sergey Fomin and Andrei Zelevinsky have invented cluster algebras at the beginning of this decade with the aim of creating an algebraic framework for the study of canonical bases in quantum groups and total positivity in algebraic groups.…
We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
Crystal basis theory for the queer Lie superalgebra was developed by Grantcharov et al. and it was shown that semistandard decomposition tableaux admit the structure of crystals for the queer Lie superalgebra or simply…
We construct an infinite family of homology theories of framed links in thickened surfaces, as well as a homology theory whose graded Euler characteristic is exactly the Kauffman bracket of the link in the surface. Both theories are based…