Related papers: Root systems constructed by folding of the extende…
We give a birational realization of affine Weyl group of type $A^{(1)}_{m-1} \times A^{(1)}_{n-1}$. We apply this representation to construct some discrete integrable systems and discrete Painlev\'e equations. Our construction has a…
If $x$ and $y$ are roots in the root system with respect to the standard (Tits) geometric realization of a Coxeter group $W$, we say that $x$ \emph{dominates} $y$ if for all $w\in W$, $wy$ is a negative root whenever $wx$ is a negative…
The classification of Nichols algebras is an essential step in the classification theory of pointed Hopf algebras by lifting method of N. Andruskiewitsch and H.-J. Schneider. Arithmetic root systems are invariants of Nichols algebras of…
We define affine Super Yangian $Y_{\hbar}(\hat{sl}(m|n), \Pi) $ for affine special linear superalgebra $\hat{sl}(m|n)$ and arbitrary system of simple roots $\Pi$ in terms of minimalistic system of generators. We also consider Drinfeld…
Let Phi be a reduced root system of rank r. A Weyl group multiple Dirichlet series for Phi is a Dirichlet series in r complex variables s_1,...,s_r, initially converging for Re(s_i) sufficiently large, which has meromorphic continuation to…
A wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We describe a pair of short exact sequences relating the sandpile group of a wired tree to the sandpile groups of its principal subtrees. In the case…
We define a `tree of fusion systems' and give a sufficient condition for its completion to be saturated. We apply this result to enlarge an arbitrary fusion system by extending the automorphism groups of certain of its subgroups.
A cycle basis in an undirected graph is a minimal set of simple cycles whose symmetric differences include all Eulerian subgraphs of the given graph. We define a rooted cycle basis to be a cycle basis in which all cycles contain a specified…
Combinatorial objects such as rooted trees that carry a recursive structure have found important applications recently in both mathematics and physics. We put such structures in an algebraic framework of operated semigroups. This framework…
We determine the unipotent orbits attached to degenerate Eisenstein series on general linear groups. This confirms a conjecture of David Ginzburg. This also shows that any unipotent orbit of general linear groups does occur as the unipotent…
Weyl group multiple Dirichlet series, introduced by Brubaker, Bump, Chinta, Friedberg and Hoffstein, are expected to be Whittaker coefficients of Eisenstein series on metaplectic groups. Chinta and Gunnells constructed these multiple…
A function group is a finitely generated Kleinian group with an invariant connected component of its region of discontinuity. An extended function group is a finitely generated extended Kleinian group that contains orientation reversing…
In the present paper we consider the problem of constructing all the projective rooted spanning trees of a given graph. We propose an algorithm based on reducing this problem to the problem of constructing all the maximal independent sets…
We introduce a combinatorial version of Stallings-Bestvina-Feighn-Dunwoody folding sequences. We then show how they are useful in analyzing the solvability of the uniform subgroup membership problem for fundamental groups of graphs of…
This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed $k\ge2$. In the…
In this paper we study embeddings of unitriangular groups UT$_n(\mathbb{F}_p)$ arising under adjunction of roots. We construct embeddings of UT$_n(\mathbb{F}_p)$ in UT$_m(\mathbb{F}_p)$, for $n \geq 2$, $m=(n-1)p^s + 1$, $s \in…
The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…
To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…
In this article we provide a new finite class of elements in any Coxeter system (W,S) called low elements. They are defined from Brink and Howlett's small roots, which are strongly linked to the automatic structure of (W,S). Our first main…
We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…