Related papers: A Method of Classifying Simple Laced Root Systems

Generalized alcoved polytopes are polytopes whose facet normals are roots in a given root system. We call a set of points in an alcoved polytope a generating set if there does not exist a strictly smaller alcoved polytope containing it. The…

We give a simple formula for the signature of a foldable triangulation of a lattice polygon in terms of its boundary. This yields lower bounds on the number of real roots of certain of systems of polynomial equations known as "Wronski…

In most introductory numerical analysis textbooks, the treatment of a single nonlinear equation often consists of a collection of all-purpose methods that frequently do not work or are inefficient. These textbooks neglect to teach the…

Rooted binary perfect phylogenies provide a generalization of rooted binary unlabeled trees in which each leaf is assigned a positive integer value that corresponds in a biological setting to the count of the number of indistinguishable…

In this paper we give a sufficient and necessary condition for two rooted trees with the same plucking polynomial. Furthermore, we give a criteria for a sequence of non-negative integers to be realized as a rooted tree.

This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they…

A poset is called upper homogeneous, or "upho," if all of its principal order filters are isomorphic to the whole poset. In previous work of the first author, it was shown that each (finite-type N-graded) upho lattice has associated to it a…

We define a total order, which we call rooted order, on minimal generating set of $J(P_n)^s$ where $J(P_n)$ is the cover ideal of a path graph on $n$ vertices. We show that each power of a cover ideal of a path has linear quotients with…

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…

We introduce a new canonical form of lattices called the systematic normal form (SNF). We show that for every lattice there is an efficiently computable "nearby" SNF lattice, such that for any lattice one can solve lattice problems on its…

We classify regular subalgebras of affine Kac-Moody algebras in terms of their root systems. In the process, we establish that a root system of a subalgebra is always an intersection of the root system of the algebra with a sublattice of…

We focus on two important classes of lattices, the well-rounded and the cyclic. We show that every well-rounded lattice in the plane is similar to a cyclic lattice, and use this cyclic parameterization to count planar well-rounded…

Let $R$ be a reduced irreducible root system, $h$ its Coxeter number and $m$ a positive integer smaller than $h$. Choose of base of $R$, whence a corresponding height function, and let $R(m)$ be the set of roots whose height is a multiple…

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

A ringoid is a set with two binary operations that are linked by the distributive laws. We study special classes of ringoids that are congruence-simple or ideal-simple. In particular, we examine generalised parasemifields and…

We first show that the tilings of a general domain form a lattice which we then undertake to decompose and generate without any redundance. To this end, we study extensively the relatively simple case of hexagons and their deformations. We…

With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…

Splint is a decomposition of root system into union of root systems. Splint of root system for simple Lie algebra appears naturally in studies of (regular) embeddings of reductive subalgebras. Splint can be used to construct branching…

We categorify one half of the small quantum sl(2) at a prime root of unity. An extension of this construction to an arbitrary simply-laced case is proposed.

We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…