English
Related papers

Related papers: Bounded reduction of orthogonal matrices over poly…

200 papers

We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on…

Number Theory · Mathematics 2016-09-07 Igor Rivin

A partial formula is provided to calculate the smallest number of vertices possible in a quadrangulation on the closed orientable 2-manifold of given genus. This extends the previously known partial formula due to N. Hartsfield and G.…

Combinatorics · Mathematics 2012-08-28 Serge Lawrencenko

Many statistical problems involve the estimation of a $\left(d\times d\right)$ orthogonal matrix $\textbf{Q}$. Such an estimation is often challenging due to the orthonormality constraints on $\textbf{Q}$. To cope with this problem, we…

Methodology · Statistics 2019-06-04 Luca Bagnato , Antonio Punzo

Calder\'on-Zygmund decompositions of functions have been used to prove weak-type (1,1) boundedness of singular integral operators. In many examples, the decomposition is done with respect to a family of balls that corresponds to some family…

Classical Analysis and ODEs · Mathematics 2012-08-15 H. F. Bloch

We compute the kernel of the stabilization map for $K_1$-functors modeled on split Chevalley groups of types $B_l, C_l, E_l$ one step below the stable range. For the groups of type $B_l$ this implies early injective stability for $K_1(B_l,…

Group Theory · Mathematics 2015-02-10 Sergey Sinchuk

This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…

Number Theory · Mathematics 2016-01-08 Jens-Dietrich Bauch

The Restricted Invertibility problem is the problem of selecting the largest subset of columns of a given matrix $X$, while keeping the smallest singular value of the extracted submatrix above a certain threshold. In this paper, we address…

Probability · Mathematics 2015-12-07 Stephane Chretien

The aim of this paper is to study finite orthogonal polynomials on a cone of revolution and its surface. We define two classes of finite orthogonal polynomials on the solid cone and derive their corresponding differential equations and…

Classical Analysis and ODEs · Mathematics 2026-03-18 Ömer Faruk Et , Esra Çekirdek , Rabia Aktaş Karaman

We prove that every isometry of between (not-necessarily orthogonal) summands of a unimodular quadratic space over a semiperfect ring can be extended an isometry of the whole quadratic space. The same result was proved by Reiter for the…

Rings and Algebras · Mathematics 2015-08-14 Uriya A. First

We present a hierarchy of tractable relaxations to obtain lower bounds on the minimum value of a polynomial over a constraint set defined by polynomial equations. In contrast to previous convex relaxation techniques for this problem, our…

Optimization and Control · Mathematics 2025-07-23 Elvira Moreno , Venkat Chandrasekaran

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Number Theory · Mathematics 2024-09-05 Philipp Habegger , Alina Ostafe , Igor E. Shparlinski

Let $X:=\mathbb{A}^{n}_{R}$ be the $n$-dimensional affine space over a discrete valuation ring $R$ with fraction field $K$. We prove that any pointed torsor $Y$ over $\mathbb{A}^{n}_{K}$ under the action of an affine finite type group…

Algebraic Geometry · Mathematics 2019-03-14 Marco Antei , Jorge A. Esquivel A

Matrix polynomials given in an orthogonal basis are considered. Following the ideas of Mackey et al. "Vector spaces of Linearizations for Matrix Polynomials" (2006), the vec- tor spaces, called M1(P), M2(P) and DM(P), of potential…

Rings and Algebras · Mathematics 2017-03-03 Heike Faßbender , Philip Saltenberger

Constrained orthogonal polynomials have been recently introduced in the study of the Hohenberg-Kohn functional to provide basis functions satisfying particle number conservation for an expansion of the particle density. More generally, we…

Mathematical Physics · Physics 2007-05-23 Jean-Marie Normand

We give a combinatorial characterization of minimally rigid planar frameworks with orientation-preserving crystallographic symmetry, under the constraint of forced symmetry. The main theorems are proved by extending the methods of the first…

Metric Geometry · Mathematics 2013-05-31 Justin Malestein , Louis Theran

Rank-constrained matrix problems appear frequently across science and engineering. The convergence analysis of iterative algorithms developed for these problems often hinges on local error bounds, which correlate the distance to the…

Optimization and Control · Mathematics 2025-10-03 Ruoning Chen , Defeng Sun , Liping Zhang

We revisit the main result of Carmosino et al \cite{CILM18} which shows that an $\Omega(n^{\omega/2+\epsilon})$ size noncommutative arithmetic circuit size lower bound (where $\omega$ is the matrix multiplication exponent) for a…

Computational Complexity · Computer Science 2023-08-10 V. Arvind , Abhranil Chatterjee

Given a real semisimple connected Lie group $G$ and a discrete subgroup $\Gamma < G$ we prove a precise connection between growth rates of the group $\Gamma$, polyhedral bounds on the joint spectrum of the ring of invariant differential…

Representation Theory · Mathematics 2025-09-09 Christopher Lutsko , Tobias Weich , Lasse L. Wolf

We consider the following question, concerning associative algebras R over an algebraically closed field k: When can the space of (equivalence classes of) finite dimensional irreducible representations of R be topologically embedded into a…

Rings and Algebras · Mathematics 2007-05-23 Edward S. Letzter

We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and…

Computational Complexity · Computer Science 2009-02-13 Kenya Ueno