English
Related papers

Related papers: Van der Waerden Conjecture for Mixed Discriminants

200 papers

The problem of determining $DS_n$, the complex numbers that occur as an eigenvalue of an $n$-by-$n$ doubly stochastic matrix, has been a target of study for some time. The Perfect-Mirsky region, $PM_n$, is contained in $DS_n$, and is known…

Spectral Theory · Mathematics 2020-04-07 Amit Harlev , Charles R. Johnson , Derek Lim

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

Number Theory · Mathematics 2019-08-21 Madhuparna Das , Goutam Paul

The fundamental relationship between the partial quotients $b_{n+1}$ of an algebraic irrational $\alpha = \sqrt[m]{k}$ and its corresponding algebraic form $d_n = |p_n^m - k q_n^m|$ was elegantly proposed by Bombieri and van der Poorten. In…

Number Theory · Mathematics 2026-03-03 Karsten Müller

In this paper we prove a single exponential upper bound on the number of possible homotopy types of the fibres of a Pfaffian map, in terms of the format of its graph. In particular we show that if a semi-algebraic set $S \subset…

Algebraic Geometry · Mathematics 2011-02-02 Saugata Basu , Nicolai Vorobjov

In 1933, van Kampen described the fundamental groups of the complements of plane complex projective algebraic curves. Recently, Ch\'eniot-Libgober proved an analogue of this result for higher homotopy groups of the complements of complex…

Algebraic Geometry · Mathematics 2007-05-23 D. Chéniot , C. Eyral

Consider an $n \times n$ matrix polynomial $P(\lambda)$. An upper bound for a spectral norm distance from $P(\lambda)$ to the set of $n \times n$ matrix polynomials that have a given scalar $\mu\in\mathbb{C}$ as a multiple eigenvalue was…

Numerical Analysis · Mathematics 2014-10-14 E. Kokabifar , G. B. Loghmani , P. J. Psarrakos

In the present note we prove a conjecture of Demailly for finite sets of sufficiently many very general points in projective spaces. This gives a lower bound on Waldschmidt constants of such sets. Waldschmidt constants are asymptotic…

Algebraic Geometry · Mathematics 2017-01-19 Grzegorz Malara , Tomasz Szemberg , Justyna Szpond

It is known that the variety of pairs of n x n commuting upper triangular matrices isn't a complete intersection for infinitely many values of n; we show that there exists m such that this happens if and only if n > m. We also show that m <…

Algebraic Geometry · Mathematics 2008-03-18 Roberta Basili

Given two $\left( n+1\right) \times\left( n+1\right)$-matrices $A$ and $B$ over a commutative ring, and some $k\in\left\{ 0,1,\ldots,n\right\}$, we consider the $\dbinom{n}{k}\times\dbinom{n}{k}$-matrix $W$ whose entries are $\left(…

Rings and Algebras · Mathematics 2026-04-16 Darij Grinberg

We prove that if $G$ is an abelian group and $H_1x_1,\dots,H_{k}x_k$ is an irredundant (minimal) cover of $G$ with cosets, then $$|G:\bigcap_{i=1}^{k}H_{i}|=2^{O(k)}.$$ This bound is the best possible up to the constant hidden in the…

Combinatorics · Mathematics 2022-11-01 János Nagy , Péter Pál Pach , István Tomon

The theory of forbidden 0-1 matrices generalizes Turan-style (bipartite) subgraph avoidance, Davenport-Schinzel theory, and Zarankiewicz-type problems, and has been influential in many areas, such as discrete and computational geometry, the…

Combinatorics · Mathematics 2024-07-04 Seth Pettie , Gábor Tardos

We consider the eigenvalues and eigenvectors of matrices of the form M + P, where M is an n by n Wigner random matrix and P is an arbitrary n by n deterministic matrix with low rank. In general, we show that none of the eigenvalues of M + P…

Probability · Mathematics 2016-04-21 Sean O'Rourke , Philip Matchett Wood

We prove lower bounds for the worst case error of quadrature formulas that use given sample points $\X_n = \{ x_1, \dots , x_n \}$. We are mainly interested in optimal point sets $\X_n$, but also prove lower bounds that hold with high…

Numerical Analysis · Mathematics 2020-12-08 Aicke Hinrichs , David Krieg , Erich Novak , Jan Vybíral

We present reduction theorems for the problem of optimal unambiguous state discrimination (USD) of two general density matrices. We show that this problem can be reduced to that of two density matrices that have the same rank $n$ and are…

Quantum Physics · Physics 2008-06-04 Philippe Raynal , Norbert Lütkenhaus , Steven J. van Enk

In this manuscript we provide necessary and sufficient conditions for the $\textnormal{weak}(1,p)$ boundedness, $1< p<\infty,$ of discrete Fourier multipliers (Fourier multipliers on $\mathbb{Z}^n$). Our main goal is to apply the results…

Functional Analysis · Mathematics 2019-01-23 Duván Cardona

In [Adv. Math., 321 (2017) 269-286], using the theory of ultrafilters, J. H. Johnson Jr., and F. K. Richter proved the nilpotent polynomial Hales-Jewett theorem. Using this result they proved the restricted version of the van der Waerden…

Combinatorics · Mathematics 2024-08-27 Sayan Goswami

For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…

Probability · Mathematics 2012-10-04 Harrie Hendriks , Martien C. A. van Zuijlen

Let $A\in\mathbb{C}^{n\times n}$ and $\widetilde{A}\in\mathbb{C}^{n\times n}$ be two normal matrices with spectra $\{\lambda_{i}\}_{i=1}^{n}$ and $\{\widetilde{\lambda}_{i}\}_{i=1}^{n}$, respectively. The celebrated Hoffman--Wielandt…

Numerical Analysis · Mathematics 2017-07-04 Xuefeng Xu , Chen-Song Zhang

We consider representations of general non-overlapping placements of rectangles by spatial relations (west, south, east, north) of pairs of rectangles. We call a set of representations complete if it contains a representation of every…

Combinatorics · Mathematics 2017-09-01 Jannik Silvanus , Jens Vygen

Since the breakthrough superpolynomial multilinear formula lower bounds of Raz (Theory of Computing 2006), proving such lower bounds against multilinear algebraic branching programs (mABPs) has been a longstanding open problem in algebraic…

Computational Complexity · Computer Science 2026-05-12 Deepanshu Kush
‹ Prev 1 3 4 5 6 7 10 Next ›