Related papers: Frieze patterns and Farey complexes
We count the number of Coxeter's friezes over a finite field. Our method uses geometric realizations of the spaces of friezes in a certain completion of the classical moduli space $\mathcal{M}_{0,n}$ allowing repeated points in the…
We define the notion of infinite friezes of positive integers as a variation of Conway-Coxeter frieze patterns and study their properties. We introduce useful gluing and cutting operations on infinite friezes. It turns out that…
The classical Farey sequence of height $Q$ is the set of rational numbers in reduced form with denominator less than $Q$. In this paper we introduce the concept of a generalized Farey sequence. While these sequences arise naturally in the…
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
In this article new cases of the Inverse Galois Problem are established. The main result is that for a fixed integer n, there is a positive density set of primes p such that PSL_2(F_{p^n}) occurs as the Galois group of some finite extension…
The goal of this paper is to undertake an in-depth study of the phenomenon behind the Furstenberg--S\'ark\"ozy theorem, which, in its modern form due to Kamae and Mend\`es-France, states that if $E$ is a set of integers with positive…
We apply the new theory of cluster algebras of Fomin and Zelevinsky to study some combinatorial problems arising in Lie theory. This is joint work with Geiss and Schr\"oer (3, 4, 5, 6), and with Hernandez (8, 9).
A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, and then use Farey sequences for rational reconstruction.…
We study factoriality and the class groups of locally acyclic cluster algebras. To do so, we introduce a new class of rings called finite Laurent intersection rings (FLIRs), which includes locally acyclic cluster algebras, full-rank upper…
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 enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…
The entries of frieze patterns may be interpreted as coordinates of roots of a finite Weyl groupoid of rank two. We prove the existence of maximal elements in their root posets and classify those frieze patterns which can be used to build…
The notion of $SL_2$-tiling is a generalization of that of classical Coxeter-Conway frieze pattern. We classify doubly antiperiodic $SL_2$-tilings that contain a rectangular domain of positive integers. Every such $SL_2$-tiling corresponds…
We study the connection between Conway-Coxeter frieze patterns and the data of the minimal resolution of a complex curve singularity: using Popescu-Pampu's notion of the lotus of a singularity, we describe a bijection between the dual…
Recently, Dor\"oz et al. (2017) proposed a new hard problem, called the finite field isomorphism problem, and constructed a fully homomorphic encryption scheme based on this problem. In this paper, we generalize the problem to the case of…
We provide a classification of positive integral friezes on marked bordered surfaces in the style of Conway and Coxeter. More precisely, we prove that positive integral friezes are in one-to-one correspondence with ideal triangulations…
In this article we consider tame $ SL_3 $-friezes that arise by specializing a cluster of Pl\"ucker variables in the coordinate ring of the Grassmannian $ \mathscr{G}(3,n) $ to $ 1 $. We show how to calculate arbitrary entries of such…
Relational Databases are universally conceived as an advance over their predecessors Network and Hierarchical models. Superior in every querying respect, they turned out to be surprisingly incomplete when modeling transitive dependencies.…
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…
Farey's sequence is a well-known procedure used to generate proper fractions from 0 to 1. Farey sequence is commonly used in rational approximations of irrational numbers, ford circles and in Riemann hypothesis. Thus, in this paper, we aim…