English
Related papers

Related papers: Recognizing Cluster Algebras of Finite type

200 papers

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

Combinatorics · Mathematics 2022-10-11 Lewis Stanton , Jeffrey Thompson

In \cite{Elek} we proved that the limit of a weakly convergent sequence of finite graphs can be viewed as a graphing or a continuous field of infinite graphs. Thus one can associate a type $II_1$-von Neumann algebra to such graph sequences.…

Combinatorics · Mathematics 2007-05-23 Gábor Elek

We prove that if a finite group scheme $G$ over a field $k$ has essential dimension one, then it embeds in $PGL_{2/k}$. We use this to give an explicit classification of all infinitesimal group schemes of essential dimension one over any…

Algebraic Geometry · Mathematics 2019-08-23 Najmuddin Fakhruddin

We give a new simple description of the canonical bijection between the set of triangulations of n-gon and some set of Young diagrams. Using this description, we find flip transformations on this set of Young diagrams which correspond to…

Combinatorics · Mathematics 2011-06-14 Mikhail Gorsky

We classify, up to conjugacy, the finite (constant) subgroups G of adjoint absolutely simple algebraic groups of type $A_1$ over an arbitrary field $k$ of characteristic not 2.

Algebraic Geometry · Mathematics 2013-08-15 Mario Garcia-Armas

We construct the intermediate coverings of cluster-tilted algebras by defining the generalized cluster categories. These generalized cluster categories are Calabi-Yau triangulated categories with fraction CY-dimension and have also cluster…

Representation Theory · Mathematics 2010-05-03 Bin Zhu

We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.

Group Theory · Mathematics 2024-12-23 Daniela Bubboloni , Nicolas Pinzauti

Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins…

Combinatorics · Mathematics 2017-08-24 Ruben A. Hidalgo

We generalise surface cluster algebras to the case of infinite surfaces where the surface contains finitely many accumulation points of boundary marked points. To connect different triangulations of an infinite surface, we consider infinite…

Geometric Topology · Mathematics 2018-12-13 Ilke Canakci , Anna Felikson

We classify and construct irreducible completely splittable representations of affine and finite Hecke-Clifford algebras over an algebraically closed field of characteristic not equal to 2.

Representation Theory · Mathematics 2010-12-03 Jinkui Wan

Dynkin's classification of maximal subalgebras of simple finite dimensional complex Lie algebras is generalized to linear Lie superalgebras. Namely, the maximal non-simple irreducible subalgebras of $\mathfrak{gl}(p|q), \mathfrak{q}(n),…

Representation Theory · Mathematics 2013-11-19 Irina Shchepochkina

This is an introduction to some aspects of Fomin-Zelevinsky's cluster algebras and their links with the representation theory of quivers and with Calabi-Yau triangulated categories. It is based on lectures given by the author at summer…

Representation Theory · Mathematics 2010-03-23 Bernhard Keller

We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…

Group Theory · Mathematics 2019-12-02 Mohammad Farrokhi Derakhshandeh Ghouchan , Ali Azimi

A complete classification of two-dimensional algebras over algebraically closed fields is provided

Rings and Algebras · Mathematics 2018-12-04 H. Ahmed , U. Bekbaev , I. Rakhimov

We show that every $\alpha$-approximate minimum cut in a connected graph is the unique minimum $(S,T)$-terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloor2\alpha\rfloor+1$. This leads to an alternative proof…

Data Structures and Algorithms · Computer Science 2022-12-01 Calvin Beideman , Karthekeyan Chandrasekaran , Weihang Wang

The goal of this paper is to classify ``finite subgroups in U_q sl(2)'' where $q=e^{\pi\i/l}$ is a root of unity. We propose a definition of such a subgroup in terms of the category of representations of U_q sl(2); we show that this…

Quantum Algebra · Mathematics 2007-05-23 Alexander Kirillov , Viktor Ostrik

We give a simple, local process for nodes in an undirected graph to form non-adjacent clusters that (1) have at most a polylogarithmic diameter and (2) contain at least half of all vertices. Efficient deterministic distributed clustering…

Data Structures and Algorithms · Computer Science 2022-10-24 Václav Rozhoň , Bernhard Haeupler , Christoph Grunau

We show that the number of entire maximal graphs with finitely many singular points that are conformally equivalent is a universal constant that depends only on the number of singularities, namely 2^$ for graphs with n+1 singularities. We…

Differential Geometry · Mathematics 2009-03-18 Isabel Fernandez

We describe isomorphisms of groups of several periodic infinite matrices and isomorphisms of groups of invertible elements of unital locally matrix algebras.

Rings and Algebras · Mathematics 2023-01-18 Oksana Bezushchak

We initiate a systematic study of the deep points of a cluster algebra; that is, the points in the associated variety which are not in any cluster torus. We describe the deep points of cluster algebras of type A, rank 2, Markov, and…

Algebraic Geometry · Mathematics 2024-03-26 James Beyer , Greg Muller