Related papers: Factorization of Frieze Patterns

In this article we study the combinatorics of congruence subgroups of the modular group. We consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of Coxeter friezes),…

We give a short proof, based on symmetric function theory, of a formula due to Goupil and Schaeffer, counting the number of factorizations of a cycle of maximal length in the symmetric group, into the product of two permutations of given…

Let Q be a quiver without loops and 2-cycles, let A(Q) be the corresponding cluster algebra and let x be a cluster. We introduce a new class of integer vectors which we call frieze vectors relative to x. These frieze vectors are defined as…

Motivated by cluster ensembles, we introduce a new variant of frieze patterns associated to acyclic cluster algebras, which we call ${\bf Y}\textit{-frieze patterns}$. Using the mutation rules for ${\bf Y}$-variables, we define a large…

We consider the determination of the number $c_k(\alpha)$ of ordered factorisations of an arbitrary permutation on n symbols, with cycle distribution $\alpha$, into k-cycles such that the factorisations have minimal length and such that the…

For each $n > 0$ there is a one complex parameter family of homeomorphisms of the circle consisting of linear fractional transformations `conjugated by $z \to z^n$'. We show that these families are free of relations, which determines the…

The goal of this note is to compare two notions, one coming from the theory of rewrite systems and the other from proof theory: confluence and cut elimination. We show that to each rewrite system on terms, we can associate a logical system:…

Frieze patterns, as introduced by Coxeter in the 1970's, are closely related to cluster algebras without coefficients. A suitable generalization of frieze patterns, linked to cluster algebras with coefficients, has only briefly appeared in…

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

A classical tool in the study of real closed fields are the fields $K((G))$ of generalised power series (i.e., formal sums with well-ordered support) with coefficients in a field $K$ of characteristic 0 and exponents in an ordered abelian…

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

Frieze patterns have an interesting combinatorial structure, which has proven very useful in the study of cluster algebras. We introduce $(k,n)$-frieze patterns, a natural generalisation of the classical notion. A generalisation of the…

We consider a filtration on the cohomology of the structure sheaf indexed by (not necessarily reduced) divisors ``at infinity''. We show that the filtered pieces have transfers morphisms, fpqc descent, and are so called cube invariant. In…

We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of…

Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and…

We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations. Topics covered include…

We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…

In this paper, we continue the program initiated by I. Beck's now classical paper concerning zero-divisor graphs of commutative rings. After the success of much research regarding zero-divisor graphs, many authors have turned their…

Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…

We restrict the type of $2 \times 2$-matrices which can occur as simple components in the Wedderburn decomposition of the rational group algebra of a finite group. This results in a description up to commensurability of the group of units…