Related papers: Factorization of Frieze Patterns
Let $R$ be an arbitrary subset of a commutative ring. We introduce a combinatorial model for the set of tame frieze patterns with entries in $R$ based on a notion of irreducibility of frieze patterns. When $R$ is a ring, then a frieze…
We study (tame) frieze patterns over subsets of the complex numbers, with particular emphasis on the corresponding quiddity cycles. We provide new general transformations for quiddity cycles of frieze patterns. As one application, we…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…
Frieze patterns are combinatorial objects that are deeply related to cluster theory. Determinants of frieze patterns arise from triangular regions of the frieze, and they have been considered in previous works by Broline-Crowe-Isaacs, and…
Based on Berenstein and Retakh's notion of noncommutative polygons we introduce and study noncommutative frieze patterns. We generalize several notions and fundamental properties from the classic (commutative) frieze patterns to…
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…
Motivated by Conway and Coxeter's combinatorial results concerning frieze patterns, we sketch an introduction to the theory of cluster algebras and cluster categories for acyclic quivers. The goal is to show how these more abstract theories…
An $n$-ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that…
We study the non-uniqueness of factorizations of non zero-divisors into atoms (irreducibles) in noncommutative rings. To do so, we extend concepts from the commutative theory of non-unique factorizations to a noncommutative setting. Several…
Consider a one-parameter family of algebraic varieties degenerating to a reducible one. Our main result is a formula for the fundamental cycle of the limit subscheme of any family of effective Cartier divisors. The formula expresses this…
Friezes patterns are infinite arrays of numbers, in which every four neighbouring vertices arranged in a diamond satisfy the same arithmetic rule. Introduced in the late 1960s by Coxeter, and further studied by Conway and Coxeter in their…
We count numbers of tame frieze patterns with entries in a finite commutative local ring. For the ring $\mathbb{Z}/p^r\mathbb{Z}$, $p$ a prime and $r\in\mathbb{N}$ we obtain closed formulae for all heights. These may be interpreted as…
Let $Q$ be an euclidean quiver. Using friezes in the sense of Assem-Reutenauer-Smith, we provide an algorithm for computing the (canonical) cluster character associated to any object in the cluster category of $Q$. In particular, this…
We prove that, in any field of characteristic not two and not three except the five-element field, each element decomposes into a product of four factors whose sum vanishes. We also find all $k,n,q$ such that every $n\times n$ matrix over…
In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group $G$ is said to admit a uniform group factorization if there…
We show that there can be no algorithm to decide whether infinite recursively described acyclic aspherical 2-complexes are contractible. We construct such a complex that is contractible if and only if the Collatz conjecture holds.
The Collatz function is defined as C(n) = n / 2 if n is even and C(n) = 3n + 1 if n is odd. The Collatz conjecture states that every sequence generated by the Collatz function ends with the cycle (4, 2, 1) after a finite number of…
The main goal of this paper is to prove several new results about frieze patterns and their equivalents, the quiddity (or $\eta$-)sequences and to obtain a formula giving the number of non-similar frieze patterns of given finite width.
We generalize permutative representations of the Cuntz algebras for the \cka\ $\coa$ for any $A$. We characterize cyclic permutative representations by notions of cycle and chain, and show their existence and uniqueness. We show necessary…