English
Related papers

Related papers: Quiddity sequences for $\mathrm{SL}_3$-frieze patt…

200 papers

Exploring the Collatz Conjecture and changing the expression from 3n + 1 to 5n + 1, we found patterns in different sets of numbers. Some numbers reduce to one (as stated in the Collatz Conjecture), some might escape to infinity, and some…

Number Theory · Mathematics 2023-05-03 Shouvik Ahmed Antu , Raina Shrimali , Miranda Jones

With the $[0,1,2]$-family of cyclic triangulations we introduce a rich class of vertex-transitive triangulations of surfaces. In particular, there are infinite series of cyclic $q$-equivelar triangulations of orientable and non-orientable…

Combinatorics · Mathematics 2010-01-19 Frank H. Lutz

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…

Combinatorics · Mathematics 2018-07-11 Michael Cuntz

Lines and circles pose significant scalability challenges in synthetic geometry. A line with $n$ points implies ${n \choose 3}$ collinearity atoms, or alternatively, when lines are represented as functions, equality among ${n \choose 2}$…

Data Structures and Algorithms · Computer Science 2021-02-10 Daniel Selsam , Jesse Michael Han

We give a generalization of Collatz conjecture or 3n+1 problem on 2-adic completion of Q. A isometric of $Q_2$ provides information on the average behavior of the firsts terms of the sequence according to the class of $u_0$ modulo $2^m$. A…

Number Theory · Mathematics 2016-07-11 Vincent Fleckinger , Ibrahim Abdoulkarim

We study Penrose tilings of the plane $\mathbb{R}^2$ and nonperiodic infinite frieze patterns from the point of view of Cohen--Macaulay representation theory: Triangulations of the completed infinity-gon correspond to subcategories of the…

Combinatorics · Mathematics 2025-11-12 Özgür Esentepe , Eleonore Faber

We exploit Krattenthaler's bijection between the set $S_n(3\textrm{-}1\textrm{-}2)$ of permutations in $S_n$ avoiding the classical pattern $3\textrm{-}1\textrm{-}2$ and Dyck $n$-paths to study the distribution of every consecutive pattern…

Combinatorics · Mathematics 2009-04-02 M. Barnabei , F. Bonetti , M. Silimbani

The Collatz problem is generalized into $3n + 3^k$ problem. It is shown that as long as the Collatz function iterates converge to the cycle passing through the number 1, the $3n + 3^k$ sequence converges to the cycle passing through the…

General Mathematics · Mathematics 2026-02-06 David Barina , W. C. Maat

While many different models for $(\infty,1)$-categories are currently being used, it is known that they are Quillen equivalent to one another. Several higher-order analogues of them are being developed as models for $(\infty,…

Algebraic Topology · Mathematics 2016-01-20 Julia E. Bergner , Charles Rezk

We define a generalized version of the frieze variety introduced by Lee, Li, Mills, Seceleanu and the second author. The generalized frieze variety is an algebraic variety determined by an acyclic quiver and a generic specialization of…

Representation Theory · Mathematics 2019-07-09 Kiyoshi Igusa , Ralf Schiffler

We introduce a generalized $k$-FL sequence and special kind of pairs of real numbers that are related to it, and give an application on the integral solutions of a certain equation using those pairs. Also, we associate skew circulant and…

Number Theory · Mathematics 2018-11-02 WonTae Hwang , Youngwoo Kwon , Kyunghwan Song

We introduce a supersymmetric analog of the classical Coxeter frieze patterns. Our approach is based on the relation with linear difference operators. We define supersymmetric analogs of linear difference operators called Hill's operators.…

Rings and Algebras · Mathematics 2015-03-25 Sophie Morier-Genoud , Valentin Ovsienko , Serge Tabachnikov

We prove that there is an finite number of friezes in type D_n, and we provide a formula to count them. As a corollary, we obtain formulas to count the number of friezes in types B_n, C_n and G_2. We conjecture finiteness (and precise…

Combinatorics · Mathematics 2016-10-20 Bruce Fontaine , Pierre-Guy Plamondon

We discuss possible definitions of structural balance conditions in a network with preference orderings as node attributes. The main result is that for the case with three alternatives ($A,B,C$) we reduce the $(3!)^3 = 216$ possible…

Social and Information Networks · Computer Science 2022-10-06 Olle Abrahamsson , Danyo Danev , Erik G. Larsson

We study the space of linear difference equations with periodic coefficients and (anti)periodic solutions. We show that this space is isomorphic to the space of tame frieze patterns and closely related to the moduli space of configurations…

Combinatorics · Mathematics 2013-09-17 Sophie Morier-Genoud , Valentin Ovsienko , Richard Evan Schwartz , Serge Tabachnikov

The purpose of this study is to show how to get a necessary criterion for prime numbers with the help of special matrices. My special interest lies in the empirical research of these matrices and their patterns, structures and symmetries.…

General Mathematics · Mathematics 2016-08-09 Jonas Kaiser

We define the notion of a multi-sorted algebraic theory, which is a generalization of an algebraic theory in which the objects are of different "sorts." We prove a rigidification result for simplicial algebras over these theories, showing…

Algebraic Topology · Mathematics 2009-05-26 Julia E Bergner

Let $\sigma_i$, $i=1,2,3$, denote positive Borel measures on $\mathbb{R}^n$, let $\mathcal{D}$ denote the usual collection of dyadic cubes in $\mathbb{R}^n$ and let $K:\,\mathcal{D}\to[0,\infty)$ be a map. In this paper we give a…

Classical Analysis and ODEs · Mathematics 2014-04-11 Hitoshi Tanaka

We first introduce the percolation problems associated with the graph theoretical concepts of $(k,l)$-sparsity, and make contact with the physical concepts of ordinary and rigidity percolation. We then devise a renormalization…

Statistical Mechanics · Physics 2015-05-30 Julien Barré

We study properties of (bi-infinite) arrays having all adjacent $k\times k$ adjacent minors equal to one. If we further add the condition that all adjacent $(k-1)\times (k-1)$ minors be nonzero, then these arrays are necessarily of rank…

Combinatorics · Mathematics 2010-02-08 Francois Bergeron , Christophe Reutenauer