Related papers: The Structure of Root Data and Smooth Regular Embe…

The reconstruction theorem and the multilevel Schauder estimate have central roles in the analytic theory of regularity structures [17]. Inspired by [26], we provide elementary proofs for them by using the semigroup of operators.…

This paper, the third in a series, completes our description of all (radial) solutions on C* of the tt*-Toda equations, using a combination of methods from p.d.e., isomonodromic deformations (Riemann-Hilbert method), and loop groups. We…

In his seminal paper on complex reflection arrangements, Bessis introduces a Garside structure for the braid group of a well-generated irreducible complex reflection group. Using this Garside structure, he establishes a strong connection…

We construct Frobenius structures on the $\mathbb{C}^{\times}$-bundle of the complement of a toric arrangement associated with a root system, by making use of a one-parameter family of torsion free and flat connections on it. This gives…

We propose a new method to construct rigid $G$-automorphic representations and rigid $\widehat{G}$-local systems for reductive groups $G$. The construction involves the notion of euphotic representations, and the proof for rigidity involves…

Vector representations of graphs and relational structures, whether hand-crafted feature vectors or learned representations, enable us to apply standard data analysis and machine learning techniques to the structures. A wide range of…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

For an untwisted affine Lie algebra we prove an embedding of any higher level Demazure module into a tensor product of lower level Demazure modules (e.g. level one in type A) which becomes in the limit (for anti-dominant weights) the…

Tensors with unit Frobenius norm are fundamental objects in many fields, including scientific computing and quantum physics, which are able to represent normalized eigenvectors and pure quantum states. While the tensor train decomposition…

We obtain sufficient criteria for simplicity of systems, that is, rings $R$ that are equipped with a family of additive subgroups $R_s$, for $s \in S$, where $S$ is a semigroup, satisfying $R = \sum_{s \in S} R_s$ and $R_s R_t \subseteq…

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…

Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…

We investigate the Hilbert complex of elasticity involving spaces of symmetric tensor fields. For the involved tensor fields and operators we show closed ranges, Friedrichs/Poincare type estimates, Helmholtz type decompositions, regular…

Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…

There is recent interest in compressing data sets for non-sequential settings, where lack of obvious orderings on their data space, require notions of data equivalences to be considered. For example, Varshney & Goyal (DCC, 2006) considered…

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

This document is a blueprint for the formalization in Lean of the structural theory of regular matroids underlying Seymour's decomposition theorem. We present a modular account of regularity via totally unimodular representations, show that…

For a finite dimensional semisimple Lie algebra and a root of unity, Lusztig defined an infinite dimensional quantum group of divided powers. Under certain restrictions on the order of the root of unity, he constructed a Frobenius…

We prove algorithmic weak and \Szemeredi{} regularity lemmas for several classes of sparse graphs in the literature, for which only weak regularity lemmas were previously known. These include core-dense graphs, low threshold rank graphs,…

We construct the natural Frobenius structures on two families of rigid irregular $\check{G}$-connections on $\mathbb{G}_m$ (or $\mathbb{A}^1$) for a split simple group $\check{G}$: (i) the $\theta$-connections arising from Vinberg's…