Related papers: Combinatorics of $A_2$-crystals
Given a finite connected bipartite graph, finite-dimensional indecomposable semisimple Leibniz algebras are constructed. Furthermore, any finite-dimensional indecomposable semisimple Leibniz algebra admits a similar construction.
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for…
We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n $\ge$ 3 strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov…
It is shown that a.a.s. as soon as a Kronecker graph becomes connected its diameter is bounded by a constant.
The Bridge graph is a special type of graph which are constructed by connecting identical connected graphs with path graphs. We discuss different types of bridge graphs $B_{n\times l}^{m\times k}$ in this paper. In particular, we discuss…
It is shown that every Leavitt path algebra L of an arbitrary directed graph E over a field K is an arithmetical ring, that is, the two-sided ideals of L form a distributive lattice. It is also shown that L is a multiplication ring, that…
When $I$ is the edge ideal of a graph $G$, we use combinatorial properities, particularly Property $P$ on connectivity of neighbors of an edge, to classify when a binomial sum of vertices is a regular element on $R/I(G)$. Under a mild…
Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…
This paper develops techniques which are used to answer a number of questions in the theory of equivalence relations generated by continuous actions of abelian groups. The methods center around the construction of certain specialized…
For each $b \geq 5$ we construct a pair of cospectral $b$-regular graphs, where one has a perfect matching and the other one not. This solves a research problem posed by the third author at the 22nd British Combinatorial Conference.
We obtain a series of new results on the problem of irreducibility of commuting varieties associated with symmetric pairs or, in other words, $Z_2$-graded simple Lie algebras. In particular, we present many examples of reducible commuting…
We prove the connectedness of the crystal, which we introduced in our previous works.
The irreducible representations of two intermediate Casimir elements associated to the recoupling of three identical irreducible representations of $U_q(\mathfrak{sl}_2)$ are considered. It is shown that these intermediate Casimirs are…
The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…
Colloidal crystals are used to understand fundamentals of atomic rearrangements in condensed matter and build complex metamaterials with unique functionalities. Simulations predict a multitude of self-assembled crystal structures from…
We use supersymmetry transformations to design transparent and one-way reflectionless (thus unidirectionally invisible) complex crystals with balanced gain and loss profiles. The scattering coefficients are investigated using the transfer…
Using the orbicell decomposition of the Deligne-Mumford compactification of the moduli space of Riemann surfaces studied previously, a chain complex based on semistable ribbon graphs is constructed which is an extension of Konsevich's graph…
Groups defined by presentations for which the components of the corresponding star graph are the incidence graphs of generalized polygons are of interest as they are small cancellation groups that - via results of Edjvet and Vdovina - are…
We show that the second homology of the configuration spaces of a planar graph is generated under the operations of embedding, disjoint union, and edge stabilization by three atomic graphs: the cycle graph with one edge, the star graph with…