Related papers: Two-row $W$-graphs in affine type $A$
One can associate to a bipartite graph a so-called edge ring whose spectrum is an affine normal toric variety. We characterize the faces of the (edge) cone associated to this toric variety in terms of some independent sets of the bipartite…
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
In this note we study a family of graphs of groups over arbitrary base graphs where all vertex groups are isomorphic to a fixed countable sofic group $G$, and all edge groups $H<G$ are such that the embeddings of $H$ into $G$ are identical…
The representation ring of an affine algebraic group scheme can be endowed with the structure of a (special) $\lambda$-ring. We show that the same is true for the ring of symmetric representations, i.e. for the Grothendieck-Witt ring of the…
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…
Recently Bowden, Hensel and Webb defined the fine curve graph for surfaces, extending the notion of curve graphs for the study of homeomorphism or diffeomorphism groups of surfaces. Later Long, Margalit, Pham, Verberne and Yao proved that…
In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
Two Lie algebroids are presented that are linked to the construction of the linearizing output of an affine in the input nonlinear system. The algorithmic construction of the linearizing output proceeds inductively, and each stage has two…
The groups QF, QT, and QV are groups of quasi-automorphisms of the infinite binary tree. Their names indicate a similarity with Thompson's well-known groups F, T, and V. We will use the theory of diagram groups over semigroup presentations…
In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…
An etale cohomology group $W$ of some irreducible components, which is the smooth compactification of an affine curve $(X^{q^2}-X)^{q-1}=(Y^{q(q+1)}-Y^{q+1})^{q-1},$ in the stable reduction the Lubin-Tate curve of level two is related to…
We prove a weak version of Lusztig's conjecture on explicit description of the asymptotic Hecke algebras (both finite and affine), and explain its relation to Lusztig's classification of character sheaves.
We propose a definition of graph subshifts of finite type that can be seen as extending both the notions of subshifts of finite type from classical symbolic dynamics and finitely presented groups from combinatorial group theory. These are…
We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and we explicitly determine their associated…
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…
An l-group G is an abelian group equipped with a translation invariant lattice order. Baker and Beynon proved that G is finitely generated projective iff it is finitely presented. A unital l-group is an l-group G with a distinguished order…