English
Related papers

Related papers: Bounded reduction of orthogonal matrices over poly…

200 papers

In this article we define a set of matrices analogous to Vaserstein-type matrices which was introduced in the paper `Serre's problem on projective modules over polynomial rings and algebraic K-theory' by Suslin-Vaserstein in 1976. We prove…

Group Theory · Mathematics 2021-12-16 A. A. Ambily , V. K. Aparna Pradeep

In this paper, we study the small finitistic dimension of a commutative ring from the viewpoint of finitistic flat homological algebra. Using the class $FPR(R)$ of modules admitting finite projective resolutions, we investigate the…

Commutative Algebra · Mathematics 2026-04-22 Tao Xiong , Younes El Haddaoui , Hwankoo Kim , Qiang Zhou

We obtain a sharp lower bound on the isoperimetric deficit of a general polygon in terms of the variance of its side lengths, the variance of its radii, and its deviation from being convex. Our technique involves a functional minimization…

Classical Analysis and ODEs · Mathematics 2014-02-19 Emanuel Indrei , Levon Nurbekyan

In studying the structure of derived categories of module categories of group algebras or their blocks, it is fundamental to classify support $\tau$-tilting modules. Koshio and Kozakai showed that the structure of support $\tau$-tilting…

Representation Theory · Mathematics 2023-11-29 Naoya Hiramae

We determine the smallest irreducible Brauer characters for finite quasi-simple orthogonal type groups in non-defining characteristic. Under some restrictions on the characteristic we also prove a gap result showing that the next larger…

Representation Theory · Mathematics 2023-06-22 Kay Magaard , Gunter Malle

We prove Horrocks' theorem for the odd elementary orthogonal group, which gives a decomposition of an orthogonal matrix with entries from a polynomial ring $R[X]$, over a commutative ring $R$ in which 2 is invertible, as a product of an…

K-Theory and Homology · Mathematics 2025-06-13 Ambily A A , Sugilesh H

We give a uniform construction of irreducible polynomial representations of all classical groups, including spin groups, using semistandard domino tableaux. We also give an explicit decomposition of the homogeneous coordinate ring of the…

Representation Theory · Mathematics 2025-04-22 William M. McGovern

We study irreducible restrictions from modules over alternating groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. This is known when the…

Representation Theory · Mathematics 2019-03-26 Alexander Kleshchev , Lucia Morotti , Pham Huu Tiep

Building on the classification of all characteristic polynomials of integer symmetric matrices having small span (span less than 4), we obtain a classification of small-span polynomials that are the characteristic polynomial of a Hermitian…

Number Theory · Mathematics 2015-01-08 Gary Greaves

The problem of polynomial regression in which the usual monomial basis is replaced by the Bernstein basis is considered. The coefficient matrix A of the overdetermined system to be solved in the least squares sense is then a rectangular…

Numerical Analysis · Mathematics 2008-06-18 Ana Marco , Jose-Javier Martinez

The purpose of this note is twofold. First we show that, for weakly differentiable maps between Riemannian manifolds of any dimension, a smallness condition on a Morrey-norm of the gradient is sufficient to guarantee that the pulled-back…

Analysis of PDEs · Mathematics 2025-02-26 Luigi Appolloni , Ben Sharp

We generalize Baker-Bowler's theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets, and orthogonal vector sets, and…

Combinatorics · Mathematics 2025-08-13 Tong Jin , Donggyu Kim

This paper constructs polynomial bases that capture the structure of the de Rham complex with boundary conditions in disks and cylinders (both periodic and finite) in a way that respects rotational symmetry. The starting point is explicit…

Numerical Analysis · Mathematics 2026-03-26 Sheehan Olver

The speed of convergence of the R-linear GMRES is bounded in terms of a polynomial approximation problem on a finite subset of the spectrum. This result resembles the classical GMRES convergence estimate except that the matrix involved is…

Numerical Analysis · Mathematics 2011-12-15 Marko Huhtanen , Allan Perämäki

We derive a lower and an upper bound for the rank of the finite part of operator $K$-theory groups of maximal and reduced $C^*$-algebras of finitely generated groups. The lower bound is based on the amount of polynomially growing conjugacy…

K-Theory and Homology · Mathematics 2017-05-24 Süleyman Kağan Samurkaş

We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…

Commutative Algebra · Mathematics 2025-09-23 Andrei Mandelshtam

Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s)^{\ell} \oplus k(-2s+1)$, where $s \geq3$ and…

Commutative Algebra · Mathematics 2021-05-28 Keller VandeBogert

We define an equivalence relation on periodic continued fractions with partial quotients in a ring $\mathcal{O} \subseteq \mathbf{C}$, a group law on these equivalence classes, and a map from these equivalence classes to matrices in…

Number Theory · Mathematics 2023-07-07 Bradley W. Brock , Bruce W. Jordan , Lawren Smithline

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…

Computational Complexity · Computer Science 2013-02-15 Mrinal Kumar , Gaurav Maheshwari , Jayalal Sarma M. N

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

Data Structures and Algorithms · Computer Science 2019-02-15 Zeev Dvir , Alexander Golovnev , Omri Weinstein