English
Related papers

Related papers: Classification of the root systems $R(m)$

200 papers

For every $k\ge 2$ and $\Delta$, we prove that there exists a constant $C_{\Delta,k}$ such that the following holds. For every graph $H$ with $\chi(H)=k$ and every tree with at least $C_{\Delta,k}|H|$ vertices and maximum degree at most…

Combinatorics · Mathematics 2025-09-17 Richard Montgomery , Matías Pavez-Signé , Jun Yan

We prove a result that can be seen as an analogue of the P\'olya-Carlson theorem for multivariate D-finite power series with coefficients in $\bar{\mathbb{Q}}$. In the special case that the coefficients are algebraic integers, our main…

Number Theory · Mathematics 2023-06-06 Jason P. Bell , Shaoshi Chen , Khoa D. Nguyen , Umberto Zannier

We consider random systems of equations over the reals, with $m$ equations and $m$ unknowns $P_i(t)+X_i(t)=0$, $t\in\mathbb{R}^m$, $i=1,...,m$, where the $P_i$'s are non-random polynomials having degrees $d_i$'s (the "signal") and the…

Probability · Mathematics 2009-02-09 Diego Armentano , Mario Wschebor

In this article the notion of the nondecreasing (ND) rank of a matrix or tensor is introduced. A tensor has an ND rank of r if it can be represented as a sum of r outer products of vectors, with each vector satisfying a monotonicity…

Machine Learning · Statistics 2025-10-21 Andrew McCormack

Inspired by the infinite families of finite and affine root systems, we consider a "stretching" operation on general crystallographic root systems which, on the level of Coxeter diagrams, replaces a vertex with a path of unlabeled edges. We…

Combinatorics · Mathematics 2020-10-22 Will Dana

Burr, Erd\H{o}s, Faudree, Rousseau and Schelp initiated the study of Ramsey numbers of trees versus odd cycles, proving that $R(T_n, C_m) = 2n - 1$ for all odd $m \ge 3$ and $n \ge 756m^{10}$, where $T_n$ is a tree with $n$ vertices and…

Combinatorics · Mathematics 2019-11-19 Matthew Brennan

This paper studies generic and perturbation properties inside the linear space of $m\times (m+n)$ polynomial matrices whose rows have degrees bounded by a given list $d_1, \ldots, d_m$ of natural numbers, which in the particular case $d_1 =…

Numerical Analysis · Mathematics 2017-12-12 Froilán M. Dopico , Paul Van Dooren

We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and…

Algebraic Topology · Mathematics 2023-03-13 Ángel Javier Alonso , Michael Kerber

A rooted tree module (RTM) $M:=M(T,F)$ over a zero-relation algebra $\Lambda:=\mathcal KQ/\langle\rho\rangle$ over a field $\mathcal K$ is given by the data of a quiver morphism $F:T\to Q$ from a rooted tree $T$ (either with a source or a…

Representation Theory · Mathematics 2025-08-12 Suraj Mishra , Amit Kuber

Let $k$ be an algebraically closed field of characteristic $p>0$. Let $c,d,m$ be positive integers. Let $D$ be a $p$-divisible group of codimension $c$ and dimension $d$ over $k$. Let $\scrD$ be a versal deformation of $D$ over a smooth…

Number Theory · Mathematics 2012-07-25 Adrian Vasiu

We define and study root graded groups, that is, groups graded by finite root systems. This notion generalises several existing concepts in the literature, including in particular Jacques Tits' notion of RGD-systems. The most prominent…

Group Theory · Mathematics 2024-04-03 Torben Wiedemann

We prove several formulas for the distribution of positive roots.

Combinatorics · Mathematics 2018-01-01 Gennadiy Ilyuta

We introduce a general tensor model suitable for data analytic tasks for {\em heterogeneous} datasets, wherein there are joint low-rank structures within groups of observations, but also discriminative structures across different groups. To…

Machine Learning · Statistics 2022-10-04 Davoud Ataee Tarzanagh , George Michailidis

A root lattice is a finite rank $\mathbb{Z}$-lattice generated by elements $x$ satisfying $x\cdot x=2$. It is well-known that the root lattices have an $ADE$ classification and they play a prominent role in the study of even unimodular…

Combinatorics · Mathematics 2026-03-31 Ryotaro Sakamoto , Miyu Suzuki , Hiroyoshi Tamori

Let $d \in \N$ and let $\D^d$ denote the class of all pairs $(R,M)$ in which $R = \bigoplus_{n \in \N_0} R_n$ is a Noetherian homogeneous ring with Artinian base ring $R_0$ and such that $M$ is a finitely generated graded $R$-module of…

Commutative Algebra · Mathematics 2009-05-18 Markus Brodmann , Maryam Jahangiri , Cao Huy Linh

For any real-valued $k > 1$, we consider the tree rooted at 0, where each positive integer $n$ has parent $\lfloor\frac{n}{k}\rfloor$. The average number of children per node is $k$, thus this definition gives a natural way to extend…

Number Theory · Mathematics 2023-02-14 Agniv Sarkar , Eric Severson

In this article we study quotients of deformations of simple singularities, and attempt to characterize them in terms of subsystems of simple root systems. The quotient of a semiuniversal deformation of a simple singularity of inhomogeneous…

Representation Theory · Mathematics 2018-07-26 Antoine Caradot

The notion of a descent polynomial, a function in enumerative combinatorics that counts permutations with specific properties, enjoys a revived recent research interest due to its connection with other important notions in combinatorics,…

Combinatorics · Mathematics 2021-09-13 Angel Raychev

Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is…

Representation Theory · Mathematics 2024-12-02 Riju Bindua , Thomas Brüstle , Luis Scoccola

We examine certain maps from root systems to vector spaces over finite fields. By choosing appropriate bases, the images of these maps can turn out to have nice combinatorial properties, which reflect the structure of the underlying root…

Combinatorics · Mathematics 2007-05-23 Kevin Purbhoo