Related papers: Linearly recursive sequences and Dynkin diagrams
Building on work by Geiss-Leclerc-Schroer and by Buan-Iyama-Reiten-Scott we investigate the link between certain cluster algebras with coefficients and suitable 2-Calabi-Yau categories. These include the cluster-categories associated with…
We study Fomin-Zelevinsky's mutation rule in the context of noncrystallographic root systems. In particular, we construct approximately periodic sequences of real numbers for the noncrystallographic root systems of rank 2 by adjusting the…
Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…
Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…
Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network…
Tyomkin's correspondence theorem states the equality of counts of rational curves of fixed homology class in a toric surface satisfying point and cross-ratio conditions with their tropical counterparts. Such correspondence theorems allow us…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
Graphs which generalize the simple or affine Dynkin diagrams are introduced. Each diagram defines a bilinear form on a root system and thus a reflection group. We present some properties of these groups and of their natural "Coxeter…
We establish a surprisingly close relationship between universal Horn classes of directed graphs and varieties generated by so-called adjacency semigroups which are Rees matrix semigroups over the trivial group with the unary operation of…
The (usual) Caldero-Chapoton map is a map from the set of objects of a category to a Laurent polynomial ring over the integers. In the case of a cluster category, it maps "reachable" indecomposable objects to the corresponding cluster…
A sequence $\{z_n\}_{n\geq0}$ is called ratio log-convex in the sense that the ratio sequence $\{\frac{z_{n+1}}{z_n}\}_{n\geq0}$ is log-convex. Based on a three-term recurrence for sequences, we develop techniques for dealing with the ratio…
LP algebras, introduced by Lam and Pylyavskyy, are a generalization of cluster algebras. These algebras are known to have the Laurent phenomenon, but positivity remains conjectural. Graph LP algebras are finite LP algebras encoded by a…
The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Any graph which is an induced subgraph of a graph in this sequence is called a Burling graph. These graphs have attracted some attention because they…
Any automorphism of the Dynkin diagram of a symmetrizable Kac-Moody algebra induces an automorphism of the algebra and a mapping between its highest weight modules. For a large class of such Dynkin diagram automorphisms, we can describe…
Given a morphism of (small) groupoids with injective object map, we provide sufficient and necessary conditions under which the induction and co-induction functors between the categories of linear representations are naturally isomorphic. A…
We employ resurgent transseries as algebraic tools to investigate two self-consistent Dyson-Schwinger equations, one in Yukawa theory and one in quantum electrodynamics. After a brief but pedagogical review, we derive fixed point equations…
We consider the quiver Yangians associated to general affine Dynkin diagrams. Although the quivers are generically not toric, the algebras have some similar structures. The odd reflections of the affine Dynkin diagrams should correspond to…
Some families of graphs, such as the n-cubes and Sierpinski gaskets, are self-similar. In this paper we show how such recursive structure can be used systematically to prove isoperimetric theorems.
We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…
This paper proves that two differently defined rooted binary trees are isomorphic. The first tree is one associated to a version of Farey sequences where the vertices correspond to the open intervals formed by two successive terms in the…