English
Related papers

Related papers: Upper Hessenberg and Toeplitz Bohemians

200 papers

We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…

Combinatorics · Mathematics 2020-01-07 Carlos Hoppen , Giovane Mansan

If matrices almost satisfying a group relation are close to matrices exactly satisfying the relation, then we say that a group is matricially stable. Here "almost" and "close" are in terms of the Hilbert-Schmidt norm. Using tracial 2-norm…

Operator Algebras · Mathematics 2019-03-27 Don Hadwin , Tatiana Shulman

For every odd prime $p$ and every integer $n\geq 12$ there is a Heisenberg group of order $p^{5n/4+O(1)}$ that has $p^{n^2/24+O(n)}$ pairwise nonisomorphic quotients of order $p^{n}$. Yet, these quotients are virtually indistinguishable.…

Group Theory · Mathematics 2015-01-23 Mark L. Lewis , James B. Wilson

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

Number Theory · Mathematics 2022-10-04 Artūras Dubickas , Min Sha

We study maximal horizontal subgroups of Carnot groups of Heisenberg type. We classify those of dimension half of that of the canonical distribution ("lagrangians") and illustrate some notable ones of small dimension. An infinitesimal…

Differential Geometry · Mathematics 2007-05-23 A. Kaplan , F. Levstein , L. Saal , A. Tiraboschi

Hermitian and unitary matrices are two representatives of the class of normal matrices whose full eigenvalue decomposition can be stably computed in quadratic computing com plexity. Recently, fast and reliable eigensolvers dealing with low…

Numerical Analysis · Mathematics 2019-07-26 Gianna M. Del Corso , Federico Poloni , Leonardo Robol , Raf Vandebril

We explore the regularity of the roots of Garding hyperbolic polynomials and real stable polynomials. As an application we obtain new regularity results of Sobolev type for the eigenvalues of Hermitian matrices and for the singular values…

Classical Analysis and ODEs · Mathematics 2021-04-21 Armin Rainer

We prove a height-estimate (distance from the tangent hyperplane) for $\Lambda$-minima of the perimeter in the sub-Riemannian Heisenberg group. The estimate is in terms of a power of the excess ($L^2$-mean oscillation of the normal) and its…

Classical Analysis and ODEs · Mathematics 2016-01-20 Roberto Monti , Davide Vittone

By expressing polynomials in the basis of Chebyshev polynomials, certain families of hyperbolic polynomials appear naturally. Some of these families have all their roots in the interval $[-2,2]$. In many cases the span of the family of…

Combinatorics · Mathematics 2019-01-01 Stefano Capparelli , Alberto Del Fra

We show that the Mahler measure of every Borwein polynomial -- a polynomial with coefficients in $ \{-1,0,1 \}$ having non-zero constant term -- can be expressed as a maximal Lyapunov exponent of a matrix cocycle that arises in the spectral…

Dynamical Systems · Mathematics 2020-08-03 Michael Baake , Michael Coons , Neil Manibo

Spectral properties of Toeplitz operators and their finite truncations have long been central in operator theory. In the finite dimensional, non-normal setting, the spectrum is notoriously unstable under perturbations. Random perturbations…

Probability · Mathematics 2025-09-17 Anirban Basak

We explore the asymptotic convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices. These are natural matrix analogs of scalar nonnegative…

Probability · Mathematics 2025-10-21 Hongjian Wang , Aaditya Ramdas

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

Combinatorics · Mathematics 2012-01-06 Shmuel Friedland

We consider a family of random normal matrix models whose eigenvalues tend to occupy lemniscate type droplets as the size of the matrix increases. Under the insertion of a point charge, we derive the scaling limit at the singular boundary…

Probability · Mathematics 2023-05-08 Sung-Soo Byun , Seung-Yeop Lee , Meng Yang

In previous work, the authors established various bounds for the dimensions of degree $n$ cohomology and $\Ext$-groups, for irreducible modules of semisimple algebraic groups $G$ (in positive characteristic $p$) and (Lusztig) quantum groups…

Representation Theory · Mathematics 2010-08-16 Brian Parshall , Leonard Scott

We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential…

Commutative Algebra · Mathematics 2020-11-17 Richard Gustavson , Alexey Ovchinnikov , Gleb Pogudin

Consider a normal Ornstein--Uhlenbeck semigroup in $\Bbb{R}^n$, whose covariance is given by a positive definite matrix. The drift matrix is assumed to have eigenvalues only in the left half-plane. We prove that the associated maximal…

Functional Analysis · Mathematics 2021-01-08 Valentina Casarino , Paolo Ciatti , Peter Sjögren

We consider partial symmetric Toeplitz matrices where a positive definite completion exists. We characterize those patterns where the maximum determinant completion is itself Toeplitz. We then extend these results with positive definite…

Optimization and Control · Mathematics 2018-02-05 Stefan Sremac , Hugo J. Woerdeman , Henry Wolkowicz

We develop a unified approach to bounding the largest and smallest singular values of an inhomogeneous random rectangular matrix, based on the non-backtracking operator and the Ihara-Bass formula for general random Hermitian matrices with a…

Probability · Mathematics 2024-12-13 Ioana Dumitriu , Yizhe Zhu

We consider the computation of two normal forms for matrices over the univariate polynomials: the Popov form and the Hermite form. For matrices which are square and nonsingular, deterministic algorithms with satisfactory cost bounds are…

Symbolic Computation · Computer Science 2018-05-21 Vincent Neiger , Johan Rosenkilde , Grigory Solomatov