Related papers: A combinatorial model for tame frieze patterns
Let $R$ be a commutative Noetherian ring graded by a torsionfree abelian group $G$. We introduce the notion of $G$-graded irreducibility and prove that $G$-graded irreducibility is equivalent to irreducibility in the usual sense. This is a…
We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…
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…
Frieze patterns (in the sense of Conway and Coxeter) are in close connection to triangulations of polygons. Broline, Crowe and Isaacs have assigned a symmetric matrix to each polygon triangulation and computed the determinant. In this paper…
We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
In this paper, we will be proving mathematically that scoring play combinatorial game theory covers all combinatorial games. That is, there is a sub-set of scoring play games that are identical to the set of normal play games, and a…
Let $(R, \frak m)$ be a Noetherian local ring, $M$ a finitely generated $R$-module. The aim of this paper is to prove a uniform formula for the index of reducibility of paprameter ideals of $M$ provided the polynomial type of $M$ is at most…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
We call a ring R pointwise semicommutative if for any element a in R either l(a) or r(a) is an ideal of R. A class of pointwise semicommutative rings is a strict generalization of semicommutative rings. Since reduced rings are pointwise…
We define here two new classes of saturated fusion systems, reduced fusion systems and tame fusion systems. These are motivated by our attempts to better understand and search for exotic fusion systems: fusion systems which are not the…
Let N be a square-free positive integer and let f be a newform of weight 2 on \Gamma_0(N). Let A denote the abelian subvariety of J_0(N) associated to f and let m be a maximal ideal of the Hecke algebra T that contains Ann_T(f) and has…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
In this paper, all rings are commutative with nonzero identity. Let M be an R-module. We introduce the concept of phi classical 1-absorbing prime submodules. A proper submodule N of M is a phi classical 1-absorbing prime submodule if…
The algorithm reduces the running time of an algorithm of Frieze from O(n^{1.5)) to O(n^(4/3 + o)). It also introduces the concept of admissible permutations that is used in algorithms for obtaining solutions to the AP and the TSP.
A complete understanding of the structure of all prime ideals of an infinite direct product of commutative rings (e.g. in terms of more specific objects) has remained a challenging problem for decades. In this article, new advances have…
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…
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…
We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…