Related papers: On schemes evinced by generalized additive decompo…

We classify canonical algebras such that for every dimension vector of a regular module the corresponding module variety is normal (respectively, a complete intersection). We also prove that for the dimension vectors of regular modules…

The primary purpose is to introduce and explore projective varieties, $\text{GRASS}_{\bf d}(\Lambda)$, parametrizing the full collection of those modules over a finite dimensional algebra $\Lambda$ which have dimension vector $\bf d$. These…

We describe the structure and homological properties of arbitrary generalized standard Auslander-Reiten components of artin algebras. In particular, we prove that for all but finitely many indecomposable modules in such components the Euler…

Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and…

The conjugator length function of a finitely generated group $\Gamma$ gives the optimal upper bound on the length of a shortest conjugator for any pair of conjugate elements in the ball of radius $n$ in the Cayley graph of $\Gamma$. We…

A $T$-decomposition of a graph $G$ is a set of edge-disjoint copies of $T$ in $G$ that cover the edge set of $G$. Graham and H\"aggkvist (1989) conjectured that any $2\ell$-regular graph $G$ admits a $T$-decomposition if $T$ is a tree with…

A conjecture of Kalai asserts that for $d\geq 4$, the affine type of a prime simplicial $d$-polytope $P$ can be reconstructed from the space of affine $2$-stresses of $P$. We prove this conjecture for all $d\geq 5$. We also prove the…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Fiol has characterized quotient-polynomial graphs as precisely the connected graphs whose adjacency matrix generates the adjacency algebra of a symmetric association scheme. We show that a collection of non-negative integer parameters of…

We obtain a parametric normal form for any non-degenerate perturbation of the generalized saddle-node case of Bogdanov--Takens singularity. Explicit formulas are derived and greatly simplified for an efficient implementation in any computer…

Let $(\Omega,{\mathcal F},P)$ be a probability space and $L^0({\mathcal F})$ the algebra of equivalence classes of real-valued random variables defined on $(\Omega,{\mathcal F},P)$. A left module $M$ over the algebra $L^0({\mathcal…

Using twisted nearby cycles, we define a new notion of slopes for complex holonomic D-modules. We prove a boundedness result for these slopes, study their functoriality and use them to characterize regularity. For a family of (possibly…

The aim of this note is a combinatorial description of a category of $D$-modules over an affine space, smooth along the stratification defined by an arrangement of hyperplanes. These $D$-modules are assumed to satisfy certain non-resonance…

We are concerned with the arithmetic of solutions to ordinary or partial nonlinear differential equations which are algebraic in the indeterminates and their derivatives. We call these solutions D-algebraic functions, and their equations…

All known elimination techniques for (first-order) algorithmic differentiation (AD) rely on Jacobians to be given for a set of relevant elemental functions. Realistically, elemental tangents and adjoints are given instead. They can be…

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…

Given an essentially finite type morphism of schemes f: X --> Y and a positive integer d, let f^{d}: X^{d} --> Y denote the natural map from the d-fold fiber product, X^{d}, of X over Y and \pi_i: X^{d} --> X the i'th canonical projection.…

We consider the problem of decomposing the edges of a digraph into as few paths as possible. A natural lower bound for the number of paths in any path decomposition of a digraph $D$ is $\frac{1}{2}\sum_{v\in V(D)}|d^+(v)-d^-(v)|$; any…

We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…

We prove that certain classical groups $G\subseteq {\rm GL}(d,\mathbb{R}^d)$ serve to characterize ordinary polynomials in $d$ real variables as elements of finite-dimensional subspaces of $C(\mathbb{R}^d)$ that are invariant by changes of…