Related papers: An Algorithmic Proof of Suslin's Stability Theorem…
To any pullback square of ring spectra we associate a new ring spectrum and use it to describe the failure of excision in algebraic $K$-theory. The construction of this new ring spectrum is categorical and hence allows to determine the…
Let $G$ be a reductive affine algebraic group, and let $X$ be an affine algebraic $G$-variety. We establish a (poly)stability criterion for points $x\in X$ in terms of intrinsically defined closed subgroups $H_{x}$ of $G$, and relate it…
In this work we prove a version of the Sylvester-Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for testing zeroness of $\Sigma^{[3]}\Pi\Sigma\Pi^{[2]}$…
It is shown that all four superintegrable quantum systems on the Euclidean plane possess the same underlying hidden algebra $sl(3)$. The gauge-rotated Hamiltonians, as well as their integrals of motion, once rewritten in appropriate…
For positive integers $1 \leq k \leq n$ let $M_n$ be the algebra of all $n \times n$ complex matrices and $M_n^{\le k}$ its subset consisting of all matrices of rank at most $k$. We first show that whenever $k>\frac{n}{2}$, any continuous…
We prove a multivariate strengthening of Brenti's result that every root of the Eulerian polynomial of type $B$ is real. Our proof combines a refinement of the descent statistic for signed permutations with the notion of real stability-a…
Given a proper cone $K \subseteq \mathbb{R}^n$, a multivariate polynomial $f \in \mathbb{C}[z] = \mathbb{C}[z_1, \ldots, z_n]$ is called $K$-stable if it does not have a root whose vector of the imaginary parts is contained in the interior…
We consider a space-time variational formulation of the second-order wave equation, where integration by parts is also applied with respect to the time variable. Conforming tensor-product finite element discretisations with piecewise…
We propose a quantitative direct method of proving the stability result for Gaussian rough differential equations in the sense of Gubinelli \cite{gubinelli}. Under the strongly dissipative assumption of the drift coefficient function, we…
We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and visualizing time-varying data. Stability in general plays…
In this paper, we have proposed a new method for solving the Gaussian integral. Introducing a parameter that depends on a $n$ index, we have found a general solution for this type of integral inspired by Taylor series of a simple function.…
In this paper, we develop a modified proof strategy for homological stability of linear groups, with the general linear groups serving as a primary example. Our arguments are more direct than those in the classical works of Quillen and…
In this paper we study Euclidean algorithms and the corresponding continued fractions for oriented linear Grassmanians $G(k,n)$. We propose two algorithms: Maximal Element Elimination algorithm and Minimal Element Elimination algorithm. The…
A Souslin algebra is a complete Boolean algebra whose main features are ruled by a tight combination of an antichain condition with an infinite distributive law. The present article divides into two parts. In the first part a representation…
The 4-dimensional effective theory arising from an induced gravity action for a co-dimension greater than one brane consists of multiple galileon fields pi^I, I=1...N, invariant under separate Galilean transformations for each scalar, and…
In this paper, we prove several stability theorems for multiplicities of naturally defined representations of symmetric groups. The first such theorem states that if we consider the diagonal action of the symmetric group $S_{m+r}$ on $k$…
We revisit a theorem of Grosshans and show that it holds over arbitrary commutative base ring $k$. One considers a split reductive group scheme $G$ acting on a $k$-algebra $A$ and leaving invariant a subalgebra $R$. If $R^U=A^U$ then the…
It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…
We study the projective geometry of algebraic neural layers, namely families of maps induced by a polynomial activation function, with particular emphasis on the generic Euclidean Distance degree ($\mathrm{gED}$). This invariant is…
This short note is the generalization of Faugere F4-algorithm for polynomial rings with coefficients in Euclidean rings. This algorithm computes successively a Groebner basis replacing the reduction of one single s-polynomial in…