Related papers: Frieze patterns and Farey complexes
The rigorous solution to the grating diffraction problem is a cornerstone step in many scientific fields and industrial applications ranging from the study of the fundamental properties of metasurfaces to the simulation of photolithography…
We study a $2 \times 2$ matrix equation arising naturally in the theory of Coxeter frieze patterns. It is formulated in terms of the generators of the group $\mathrm{PSL}(2,\mathbb{Z})$ and is closely related to continued fractions. It…
An elementary method for computing various prime sequences using the sequence of Farey sequences is described.
Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…
A frieze in the modern sense is a map from the set of objects of a triangulated category $\mathsf{C}$ to some ring. A frieze $X$ is characterised by the property that if $\tau x\rightarrow y\rightarrow x$ is an Auslander-Reiten triangle in…
Frieze patterns of integers were studied by Conway and Coxeter. Let $\mathscr{C}$ be the cluster category of Dynkin type $A_n$. Indecomposables in $\mathscr{C}$ correspond to diagonals in an $(n+3)$-gon. Work done by Caldero and Chapoton…
Extending the work of Freese, we further develop the theory of generalized trigonometric functions. In particular, we study to what extent the notion of polar form for the complex numbers may be generalized to arbitrary associative…
An integer n is said to be y-friable if its largest prime factor $P^+(n)$ is less than y. In this paper, it is shown that the y-friable integers less than x have a weak exponent of distribution at least $3/5-\varepsilon$ when $(\log…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
We provide a characterization of infinite frieze patterns of positive integers via triangulations of an infinite strip in the plane. In the periodic case, these triangulations may be considered as triangulations of annuli. We also give a…
Very recently planar collections of Feynman diagrams were proposed by Borges and one of the authors as the natural generalization of Feynman diagrams for the computation of $k=3$ biadjoint amplitudes. Planar collections are one-dimensional…
The aim of this paper is to introduce and study a large class of $\mathfrak{g}$-module algebras which we call factorizable by generalizing the Gauss factorization of (square or rectangular) matrices. This class includes coordinate algebras…
Let C be a clutter and let A be its incidence matrix. If the linear system x>=0;xA<=1 has the integer rounding property, we give a description of the canonical module and the a-invariant of certain normal subrings associated to C. If the…
The notion of cyclic sieving phenomenon is introduced by Reiner, Stanton, and White as a generalization of Stembridge's $q=-1$ phenomenon. The generalized cluster complexes associated to root systems are given by Fomin and Reading as a…
We study the notions of $n$-hereditary rings and its connection to the classes of finitely $n$-presented modules, FP$_n$-injective modules, FP$_n$-flat modules and $n$-coherent rings. We give characterizations of $n$-hereditary rings in…
Friezes with coefficients are maps assigning numbers to the edges and diagonals of a regular polygon such that all Ptolemy relations for crossing diagonals are satisfied. Among these, the classic Conway-Coxeter friezes are the ones where…
Computationally efficient numerical methods for high-order approximations of convolution integrals involving weakly singular kernels find many practical applications including those in the development of fast quadrature methods for…
Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{\"o}nhage and Strassen designed an algorithm that improved the multiplication time for…
This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…
Given a standard graded polynomial ring $R=k[x_1,...,x_n]$ over a field $k$ of characteristic zero and a graded $k$-subalgebra $A=k[f_1,...,f_m]\subset R$, one relates the module $\Omega_{A/k}$ of K\"ahler $k$-differentials of $A$ to the…