Related papers: An Algorithmic Proof of Suslin's Stability Theorem…

Let $R$ be a unital ring satisfying the invariant basis number property, that every stably free $R$-module is free, and that the complex of partial bases of every finite rank free module is Cohen--Macaulay. This class of rings includes…

The stability of the Ghurye-Olkin (GO) characterization of Gaussian vectors is analyzed using a partition of the vectors into equivalence classes defined by their matrix factors. The sum of the vectors in each class is near-Gaussian in the…

The Galerkin difference (GD) basis is a set of continuous, piecewise polynomials defined using a finite difference like grid of degrees of freedom. The one dimensional GD basis functions are naturally extended to multiple dimensions using…

In the first edition of Classification Theory, the second author characterized the stable theories in terms of saturation of ultrapowers. Prior to this theorem, stability had already been defined in terms of counting types, and the unstable…

A new set of elementary symplectic elements is described, It is shown that these also generate the elementary symplectic group {\rm ESp}$_{2n}(R)$. These generators are more symmetrical than the usual ones, and are useful to study the…

We prove symplectic versions of Suslin's famous $n!$-theorem for algebras over quadratically closed perfect fields of characteristic $\neq 2$ and for algebras over finite fields of characteristic $\neq 2$.

Let $R$ be a ring generated by $l$ elements with stable range $r$. Assume that the group $EL_d(R)$ has Kazhdan constant $\epsilon_0>0$ for some $d > r $. We prove that there exist $\epsilon(\epsilon_0,l) >0$ and $k \in N$, s.t. for every $n…

The Gaussian Elimination with Partial Pivoting (GEPP) is a classical algorithm for solving systems of linear equations. Although in specific cases the loss of precision in GEPP due to roundoff errors can be very significant, empirical…

A polynomial $f(x)$ over a field $K$ is called stable if all of its iterates are irreducible over $K$. In this paper we study the stability of trinomials over finite fields. Specially, we show that if $f(x)$ is a trinomial of even degree…

We introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…

We investigate the Euclidean $d$-Dimensional Stable Roommates problem, which asks whether a given set~$V$ of $d \cdot n$ points from the 2-dimensional Euclidean space can be partitioned into $n$ disjoint (unordered) subsets…

The file contains PhD Dissertation by Oskar Jakub Szyma\'nski. This work ends his study at Doctoral School of Exact and Natural Sciences at Jagiellonian University where the Author has attended in years 2019-2024. The subject of the Thesis…

We give a new combinatorial description for stable Grothendieck polynomials in terms of subdivisions of Gelfand-Zetlin polytopes. Moreover, these subdivisions also provide a description of Lascoux polynomials. This generalizes a similar…

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 consider Gaussian Random Fields on metric graphs defined implicitly as the stationary solution to a fractional SPDE driven by Gaussian white noise. Sampling from the finite element approximation requires the Cholesky factorization of the…

The ({\em classical}, {\em small quantum}, {\em equivariant}) cohomology ring of the grassmannian $G(k,n)$ is generated by certain derivations operating on an exterior algebra of a free module of rank $n$ ({\em Schubert Calculus on a…

It is a widely open problem to determine which monomials in the n-variable polynomial ring $K[x_1,...,x_n]$ over a field $K$ have the Gotzmann property, i.e. induce a Borel-stable Gotzmann monomial ideal. Since 2007, only the case $n \le 3$…

Global asymptotic stability of rational difference equations is an area of research that has been well studied. In contrast to the many current methods for proving global asymptotic stability, we propose an algorithmic approach. The…

We introduce a new stabilization for discontinuous Galerkin methods for the Poisson problem on polygonal meshes, which induces optimal convergence rates in the polynomial approximation degree $p$. In the setting of [S. Bertoluzza and D.…

Let $K$ be a number field and let $G$ be a finitely generated subgroup of $K^\times$. For all but finitely many primes $\mathfrak p$ of $K$, the reduction $(G \bmod \mathfrak p)$ generates a well-defined subgroup of the multiplicative group…