Related papers: A Method of Classifying Simple Laced Root Systems
We present a new method for obtaining norm bounds for random matrices, where each entry is a low-degree polynomial in an underlying set of independent real-valued random variables. Such matrices arise in a variety of settings in the…
In this paper, we introduce and analyze a normalization method for solving a system of linear equations over tropical semirings. We use a normalization method to construct an associated normalized matrix, which gives a technique for solving…
Complements of union-closed families of sets, over a finite ground set, are known as simply rooted families of sets. Cubical sets are widely studied topological objects having applications in computational homology. In this paper, we look…
The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…
Multi-relational learning has received lots of attention from researchers in various research communities. Most existing methods either suffer from superlinear per-iteration cost, or are sensitive to the given ranks. To address both issues,…
We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…
Lie systems form a class of systems of first-order ordinary differential equations whose general solutions can be described in terms of certain finite families of particular solutions and a set of constants, by means of a particular type of…
We completely classify and give explicit descriptions of the maximal closed subroot systems of real affine root systems. As an application we describe a procedure to get the classification of all regular subalgebras of affine Kac Moody…
Linking systems are crucial for studying the homotopy theory of fusion systems, but are also of interest from an algebraic point of view. We propose a definition of a linking system associated to a saturated fusion system which is more…
Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…
We define a natural lattice structure on all subsets of a finite root system that extends the weak order on the elements of the corresponding Coxeter group. For crystallographic root systems, we show that the subposet of this lattice…
We define a fragment of propositional logic where isomorphic propositions, such as $A\land B$ and $B\land A$, or $A\Rightarrow (B\land C)$ and $(A\Rightarrow B)\land(A\Rightarrow C)$ are identified. We define System I, a proof language for…
We study the iterations of the procedure of taking the contact simplex. We define the concept of the root of the simplex, which is a homothety image of contact simplex with a special coefficient greater than 1. The article shows that once…
We introduce a new iterative root-finding method for complex polynomials, dubbed {\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
We develop a family of techniques to align word embeddings which are derived from different source datasets or created using different mechanisms (e.g., GloVe or word2vec). Our methods are simple and have a closed form to optimally rotate,…
Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construction uses a single linear differential form defined from the…
The main aim of this paper is to promote a certain style of doing coinductive proofs, similar to inductive proofs as commonly done by mathematicians. For this purpose, we provide a reasonably direct justification for coinductive proofs…
A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…