English
Related papers

Related papers: Root stacks and periodic decompositions

200 papers

Matrix spherical functions associated to the compact symmetric pair $(\mathrm{SU}(m+2), \mathrm{S}(\mathrm{U}(2)\times \mathrm{U}(m))$, having reduced root system of type $\mathrm{BC}_2$, are studied. We consider an irreducible…

Classical Analysis and ODEs · Mathematics 2022-07-15 Erik Koelink , Jie Liu

Let M be a complete n-dimensional Riemannian spin manifold, partitioned by q two-sided hypersurfaces which have a compact transverse intersection N and which in addition satisfy a certain coarse transversality condition. Let E be a…

K-Theory and Homology · Mathematics 2018-09-25 Thomas Schick , Mostafa Esfahani Zadeh

Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very…

Numerical Analysis · Mathematics 2020-11-23 James B. Wilson

The relation between the spectral decomposition of a self-adjoint operator which is realizable as a higher order recurrence operator and matrix-valued orthogonal polynomials is investigated. A general construction of such operators from…

Classical Analysis and ODEs · Mathematics 2014-03-13 Wolter Groenevelt , Mourad E. H. Ismail , Erik Koelink

Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…

Combinatorics · Mathematics 2026-03-04 Florian Bridoux , Christophe Crespelle , Thi Ha Duong Phan , Adrien Richard

We shall describe the divisor class group and the graded canonical module of the multi-section ring for a normal projective variety X and Weil divisors D_1,..., D_s on X under a mild condition. In the proof, we use the theory of Krull…

Commutative Algebra · Mathematics 2015-01-14 Kazuhiko Kurano

We show an algorithm that, given an $n$-vertex graph $G$ and a parameter $k$, in time $2^{O(k \log k)} n^{O(1)}$ finds a tree decomposition of $G$ with the following properties: * every adhesion of the tree decomposition is of size at most…

Data Structures and Algorithms · Computer Science 2020-09-29 Marek Cygan , Paweł Komosa , Daniel Lokshtanov , Michał Pilipczuk , Marcin Pilipczuk , Saket Saurabh , Magnus Wahlström

We consider the derived category of coherent sheaves on a complex vector space equivariant with respect to an action of a finite reflection group G. In some cases, including Weyl groups of type A, B, G_2, F_4, as well as the groups…

Algebraic Geometry · Mathematics 2017-06-07 Alexander Polishchuk , Michel Van den Bergh

In 2015, Guth proved that for any set of $k$-dimensional bounded complexity varieties in $\mathbb{R}^d$ and for any positive integer $D$, there exists a polynomial of degree at most $D$ whose zero set divides $\mathbb{R}^d$ into open…

Computational Geometry · Computer Science 2026-01-13 Boris Aronov , Esther Ezra , Joshua Zahl

A rapid algorithm is derived for the Helmholtz--Hodge decomposition on the surface of the sphere in spherical coordinates. The algorithm uncouples modes of spherical harmonics with different absolute order, writes the conversion as…

Numerical Analysis · Mathematics 2018-09-13 Julien Molina , Richard Mikael Slevinsky

The purpose of this paper is to give an explicit description of the irreducible decomposition of the multigraded S_n-module of coinvariants of S_n x S_n. Many of the results presented can be extended to analogous questions for other finite…

Combinatorics · Mathematics 2007-05-23 Francois Bergeron , Francois Lamontagne

We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{\"o}nhage's efficient algorithm of 1982 for a single root radius. We revisit this extension, advance it, based on our simple but…

Symbolic Computation · Computer Science 2021-07-05 Rémi Imbach , Victor Y. Pan

Finite discrete-time dynamical systems (FDDS) model phenomena that evolve deterministically in discrete time. It is possible to define sum and product operations on these systems (disjoint union and direct product, respectively) giving a…

Discrete Mathematics · Computer Science 2025-02-05 François Doré , Kévin Perrot , Antonio E. Porreca , Sara Riva , Marius Rolland

We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…

Classical Analysis and ODEs · Mathematics 2019-12-17 Yuan Xu

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Combinatorics · Mathematics 2014-10-24 Béla Csaba , Daniela Kühn , Allan Lo , Deryk Osthus , Andrew Treglown

Given a smooth variety $X$ with an action of a finite group $G$, and a semiorthogonal decomposition of the derived category, $\mathcal{D}([X/G])$, of $G$-equivariant coherent sheaves on $X$ into subcategories equivalent to derived…

Algebraic Geometry · Mathematics 2019-09-10 Bronson Lim , Alexander Polishchuk

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D \geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Combinatorics · Mathematics 2014-10-24 Béla Csaba , Daniela Kühn , Allan Lo , Deryk Osthus , Andrew Treglown

In the theory of the moduli-stacks of n-pointed stable curves, there are two fundamental functors, contraction and stabilization. These functors are constructed in [4], where they are used to show that the various \bar{M_{g,n}}'s are…

Algebraic Geometry · Mathematics 2016-11-25 Finn F. Knudsen

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

Number Theory · Mathematics 2008-10-31 Jordi Guardia , Jesus Montes , Enric Nart

Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…

Combinatorics · Mathematics 2007-05-23 Yurii Burman , Boris Shapiro