相关论文: Brauer tree algebras have $\binom{2n}{n}$ $2$-tilt…

We show that $\tau$-tilting finite simply connected algebras are representation-finite. Then, some related algebras are considered, including iterated tilted algebras, tubular algebras and so on. We also prove that the $\tau$-tilting…

We initiate a statistical study of Kalai's exterior algebraic shifting, focusing on concentration phenomena for random triangulations of a fixed space. First, for a uniform $n$-vertex refinement of any given graph $G$, we show that…

We study random bipartite planar maps defined by assigning nonnegative weights to each face of a map. We prove that for certain choices of weights a unique large face, having degree proportional to the total number of edges in the maps,…

Multidimensional Heisenberg algebras, whose creation and annihilation operators are the N-dimensional vectors, can be injected into simple Lie algebras g. It is demonstrated that the spectrum of their deformations can be investigated using…

Many important problems in extremal combinatorics can be stated as certifying polynomial inequalities in graph homomorphism numbers, and in particular, many ask to certify pure binomial inequalities. For a fixed collection of graphs…

The Brattelli diagram associated with a given bicolored Dynkin-Coxeter graph of type $A_n$ determines planar fractal sets obtained by infinite dissections of a given triangle. All triangles appearing in the dissection process have angles…

A split-by-edges tree of a graph G on n vertices is a binary tree T where the root = V(G), every leaf is an independent set in G, and for every other node N in T with children L and R there is a pair of vertices {u, v} in N such that L = N…

We construct via usual graph theory a class of associative dialgebras as well as a class of coassociative L-coalgebras. Tiling of the (n^2,1)-De bruijn graphs are also obtained and constructions of cubical trialgebras, (notion defined by…

We exhibit central simple algebras over the function field of a diagonal quartic surface over the complex numbers that represent the 2-torsion part of its Brauer group. We investigate whether the 2-primary part of the Brauer group of a…

Given a brane tiling, that is, a bipartite graph on a torus, we can associate with it a singular 3-Calabi-Yau variety. Using the brane tiling, we can also construct all crepant resolutions of the above variety. We give an explicit toric…

First, we give a new example of silting-discrete algebras. Second, one explores when the algebra of triangular matrices over a finite dimensional algebra is $\tau$-tilting finite. In particular, we classify algebras over which triangular…

The Jordan algebra of the symmetric matrices of order two over a field $K$ has two natural gradings by $\mathbb{Z}_2$, the cyclic group of order 2. We describe the graded polynomial identities for these two gradings when the base field is…

Let $B$ be an one-point extension of a finite dimensional $k$-algebra $A$ by a simple $A$-module at a source point $i$. In this paper, we classify the $\tau$-tilting modules over $B$. Moreover, it is shown that there are equations $$|\tilt…

Gendo-symmetric algebras were introduced by Fang and Koenig as a generalisation of symmetric algebras. Namely, they are endomorphism rings of generators over a symmetric algebra. This article studies various algebraic and homological…

In this paper, we provide a diagrammatic approach to study the branching rules for cell modules on a sequence of walled Brauer algebras. This also allows us to calculate the structure constants of multiplication over the Grothendieck ring…

Let T be a torus (not assumed to be split) over a field F, and denote by $_n{H^{2}_{et}(X,Gm)}$ the subgroup of elements of exponent dividing n in the cohomological Brauer group of a scheme X over the field F. We provide conditions on X and…

Consider a plane branch, that is, an irreducible germ of curve on a smooth complex analytic surface. We define its blow-up complexity as the number of blow-ups of points necessary to achieve its minimal embedded resolution. We show that…

We prove that for every graph $G$ with $n$ vertices, the treewidth of $G$ plus the treewidth of the complement of $G$ is at least $n-2$. This bound is tight.

Let $\Q$ be the quiver of Dynkin type $\mathbb{A}_n$ with linear orientation and $A_{n}=k\Q$. In this paper, we give a complete classification of the silted algebras of type $A_{n}$ by using the geometric models of gentle algebras. We show…

A central limit theorem for binary tree is numerically examined. Two types of central limit theorem for higher-order branches are formulated. A topological structure of a binary tree is expressed by a binary sequence, and the…