English
Related papers

Related papers: A refined determinantal inequality for correlation…

200 papers

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

Algebraic Geometry · Mathematics 2021-03-09 Niels Lubbes

For many applications, it is convenient to have good upper bounds for the norm of the inverse of a given matrix. In this paper, we obtain such bounds when A is a Nekrasov matrix, by means of a scaling matrix transforming A into a strictly…

Numerical Analysis · Mathematics 2025-01-17 Héctor Orera , Juan Manuel Peña

We study the maximum absolute value of the determinant of matrices with entries in the set of $\ell$-th roots of unity; this is a generalization of $D$-optimal designs and Hadamard's maximal determinant problem, which involves $\pm 1$…

Combinatorics · Mathematics 2025-03-17 Guillermo Nuñez Ponasso

We show that the maximal determinant D(n) for $n \times n$ ${\pm 1}$-matrices satisfies $R(n) := D(n)/n^{n/2} \ge \kappa_d > 0$. Here $n^{n/2}$ is the Hadamard upper bound, and $\kappa_d$ depends only on $d := n-h$, where $h$ is the maximal…

Combinatorics · Mathematics 2013-05-07 Richard P. Brent , Judy-anne H. Osborn , Warren D. Smith

In this work, we determine a sharp upper bound on the orthogonality defect of HKZ reduced bases up to dimension $3$. Using this result, we determine a general upper bound for the orthogonality defect of HKZ reduced bases of arbitrary rank.…

Number Theory · Mathematics 2022-08-24 Christian Porter , Edmund Dable-Heath , Cong Ling

Let $(a_n)_{n \in \mathbb{N}}$ be a Hadamard lacunary sequence. We give upper bounds for the maximal gap of the set of dilates $\{a_n \alpha\}_{n \leq N}$ modulo 1, in terms of $N$. For any lacunary sequence $(a_n)_{n \in \mathbb{N}}$ we…

Number Theory · Mathematics 2024-07-01 Eduard Stefanescu

In this framework, the extremal case corresponds to the tightest nontrivial relaxation in this hierarchy, in which every proper principal submatrix is constrained to be positive semidefinite, while the global positive semidefiniteness…

Optimization and Control · Mathematics 2026-05-12 Shaun Fallat , Samir Mondal , Hristo Sendov

We introduce a novel parametrization of the correlation matrix. The reparametrization facilitates modeling of correlation and covariance matrices by an unrestricted vector, where positive definiteness is an innate property. This…

Econometrics · Economics 2020-12-07 Ilya Archakov , Peter Reinhard Hansen

We prove an upper bound on sums of squares of minors of {+1, -1} matrices. The bound is sharp for Hadamard matrices, a result due to de Launey and Levin (2009), but our proof is simpler. We give several corollaries relevant to minors of…

Combinatorics · Mathematics 2013-09-10 Richard P. Brent , Judy-anne H. Osborn

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

We prove an exponential upper bound for the number $f(m,n)$ of all maximal triangulations of the $m\times n$ grid: \[ f(m,n) < 2^{3mn}. \] In particular, this improves a result of S. Yu. Orevkov (1999).

Combinatorics · Mathematics 2007-05-23 Emile E. Anclin

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

Combinatorics · Mathematics 2008-03-07 Shmuel Friedland

In this paper, we obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral…

Combinatorics · Mathematics 2016-07-21 Lihua You , Yujie Shu , Xiao-Dong Zhang

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

Combinatorics · Mathematics 2015-02-09 Daniel Barker , Steven Senger

We present a new, practical algorithm for computing the determinant of a non-singular dense, uniform matrix over Z; the aim is to achieve better practical efficiency, which is always at least as good as currently known methods. The…

Number Theory · Mathematics 2024-04-15 John Abbott , Claus Fieker

A new error bound for the linear complementarity problem is given when the involved matrix is a B-matrix. It is shown that this bound is sharper than some previous bounds [C.Q. Li, Y.T. Li. Note on error bounds for linear complementarity…

Numerical Analysis · Mathematics 2016-03-01 Chaoqian Li , Mengting Gan , Shaorong Yang

We prove upper and lower bounds for leading coefficient of Kolchin dimension polynomial of systems of partial linear differential equations in codimension two.

Commutative Algebra · Mathematics 2018-02-20 Marina Kondratieva

This paper is mainly devoted to the study of the differentiation index and the order for quasi-regular implicit ordinary differential algebraic equation (DAE) systems. We give an algebraic definition of the differentiation index and prove a…

Commutative Algebra · Mathematics 2008-11-19 Lisi D'Alfonso , Gabriela Jeronimo , Gustavo Massaccesi , Pablo Solernó

We consider matrix Riccati inequality arising in the theory of absolute stability, $H_\infty$ control problem, $LQ$ problem, and optimal estimation problem. In the case of sign definite frequency domain function, the solvability of Riccati…

Optimization and Control · Mathematics 2015-05-20 Kevin Kissi

In this paper, we establish a new inequality tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We…

Information Theory · Computer Science 2017-02-07 Farhad Shirani , S. Sandeep Pradhan
‹ Prev 1 4 5 6 7 8 10 Next ›