Related papers: Classification of hyperbolic Dynkin diagrams, root…

In this paper we study symmetrizable intersection matrices, namely generalized intersection matrices introduced by P. Slodowy such that they are symmetrizable. Every such matrix can be naturally associated with a root basis and a Weyl root…

We discuss the classification of reflection subgroups of finite and affine Weyl groups from the point of view of their root systems. A short case free proof is given of the well known classification of the isomorphism classes of reflection…

A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…

We present some graphical characterizations of positive definite symmetric quasi-Cartan matrices of Dynkin type $\mathbb{A}_{n}$ and $\mathbb{D}_{n}$. Our proofs are constructive, purely graph theoretical, and almost self-contained in the…

There are 432 strongly squarefree symmetric bilinear forms of signature $(2,1)$ defined over $\Z[\sqrt{2}]$ whose integral isometry groups are generated up to finite index by finitely many reflections. We adapted Allcock's method (based on…

We study the contact geometry of scalar second order hyperbolic equations in the plane of generic type. Following a derivation of parametrized contact-invariants to distinguish Monge-Ampere (class 6-6), Goursat (class 6-7) and generic…

A maniplex of rank n s an n-valent properly edge-coloured graph that generalises, simultaneously, maps on surfaces and abstract polytopes. The problem of stability in maniplexes is a natural variant of the problem of stability in graphs. A…

It is shown that graphs that generalize the ADE Dynkin diagrams and have appeared in various contexts of two-dimensional field theory may be regarded in a natural way as encoding the geometry of a root system. After recalling what are the…

For any two root subsets associated with two Carter diagrams that have the same $ADE$ type and the same size, we construct the transition matrix that maps one subset to the other. The transition between these two subsets is carried out in…

We characterize the maximal discrete subgroups of $SO^+(2,n+2)$, which contain the discriminant kernel of an even lattice, which contains two hyperbolic planes over $\mathbb{Z}$. They coincide with the normalizers in $SO^+(2,n+2)$ and are…

Motivated by the Gray code interpretation of Hamiltonian cycles in Cayley graphs, we investigate the existence of Hamiltonian cycles in tope graphs of hyperplane arrangements, with a focus on simplicial, reflection, and supersolvable…

All quasi-affine connected Generalized Dynkin Diagrams with rank $> 5$ are found. All quasi-affine Nichols (Lie braided) algebras with rank $> 5$ are also found.

A linkage diagram is obtained from the Carter diagram $\Gamma$ by adding an extra root $\gamma$, so that the resulting subset of roots is linearly independent. With every linkage diagram we associate the linkage label vector…

We say that a Hamilton cycle $C=(x_1,\ldots,x_n)$ in a graph $G$ is $k$-symmetric, if the mapping $x_i\mapsto x_{i+n/k}$ for all $i=1,\ldots,n$, where indices are considered modulo $n$, is an automorphism of $G$. In other words, if we lay…

One of the consequences of residual finiteness of triangle groups is that for any given hyperbolic triple $(\ell,m,n)$ there exist infinitely many regular hypermaps of type $(\ell,m,n)$ on compact orientable surfaces. The same conclusion…

It is known that there exists an order isomorphism between the Weyl group orbit through a minuscule weight of a simply-laced finite-dimensional simple Lie algebra and the set of all order filters in a self-dual connected d-complete poset.…

We study the Doubrov--Zelenko symplectification procedure for rank $2$ distributions with $5$-dimensional cube -- originally motivated by optimal control theory -- through the lens of Tanaka--Morimoto theory for normal Cartan connections.…

Hyperbolic polynomials have been of recent interest due to applications in a wide variety of fields. We seek to better understand these polynomials in the case when they are symmetric, i.e. invariant under all permutations of variables. We…

For even $k$, the matchings connectivity matrix $\mathbf{M}_k$ encodes which pairs of perfect matchings on $k$ vertices form a single cycle. Cygan et al. (STOC 2013) showed that the rank of $\mathbf{M}_k$ over $\mathbb{Z}_2$ is…

A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a Hamiltonian graph. Until now, the smallest known planar hypohamiltonian graph had 42 vertices, a result due to Araya and Wiener. That result…