English
Related papers

Related papers: Bounds on the permanent and some applications

200 papers

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

Computational Complexity · Computer Science 2007-05-23 Peter Buergisser , Martin Lotz

We consider the integration of two-dimensional, piecewise constant functions with respect to copulas. By drawing a connection to linear assignment problems, we can give optimal upper and lower bounds for such integrals and construct the…

Optimization and Control · Mathematics 2016-11-26 Markus Hofer , Maria Rita Iacò

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

Number Theory · Mathematics 2013-09-09 Thai Hoang Le , Jeffrey D. Vaaler

An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…

Dynamical Systems · Mathematics 2025-06-11 Christopher Cabezas , Julien Leroy

The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, often called the \emph{Sinkhorn limit} of $A$. The main result in this paper…

Rings and Algebras · Mathematics 2019-10-01 Melvyn B. Nathanson

We study symmetric arithmetic circuits and improve on lower bounds given by Dawar and Wilsenach (ArXiv 2020). Their result showed an exponential lower bound of the permanent computed by symmetric circuits. We extend this result to show a…

Computational Complexity · Computer Science 2020-09-24 Christian Engels

We present new lower bounds for the symmetric border rank of the n x n determinant for all n. Further lower bounds are given for the 3 x 3 permanent.

Computational Complexity · Computer Science 2015-11-16 Cameron Farnsworth

Computing the distribution of permanents of random matrices has been an outstanding open problem for several decades. In quantum computing, "anti-concentration" of this distribution is an unproven input for the proof of hardness of the task…

Quantum Physics · Physics 2021-04-15 Sepehr Nezami

A numerical procedure providing guaranteed two-sided bounds on the effective coefficients of elliptic partial differential operators is presented. The upper bounds are obtained in a standard manner through the variational formulation of the…

Numerical Analysis · Mathematics 2023-07-24 Liya Gaynutdinova , Martin Ladecký , Aleš Nekvinda , Ivana Pultarová , Jan Zeman

Stochastic partial differential equations of second order with two unknown parameters are studied. Based on ergodicity, two suitable families of minimum constrast estimators are introduced. Strong consistency and asymptotic normality of…

Probability · Mathematics 2018-06-12 Josef Janak

We provide a lower bound for the ratio between the ordinary and uniform exponent of both simultaneous Diophantine approximation and Diophantine approximation by linear forms in any dimension. This lower bound was conjectured by Schmidt and…

Number Theory · Mathematics 2020-04-02 Antoine Marnat , Nikolay Moshchevitin

In this paper, by using a combinatorial approach, we establish a new upper bound for the F-threshold $c^\mm(\mm)$ of determinantal rings generated by maximal minors. We prove that $c^\mm(\mm)$ coincides with the $a$-invariant in the case of…

Commutative Algebra · Mathematics 2023-10-02 Barbara Betti , Alessio Moscariello , Francesco Romeo , Jyoti Singh

A common problem to all applications of linear finite dynamical systems is analyzing the dynamics without enumerating every possible state transition. Of particular interest is the long term dynamical behaviour. In this paper, we study the…

Dynamical Systems · Mathematics 2019-04-01 Björn Lindenberg

Time-varying stochastic optimization problems frequently arise in machine learning practice (e.g. gradual domain shift, object tracking, strategic classification). Although most problems are solved in discrete time, the underlying process…

Machine Learning · Computer Science 2023-02-24 Subha Maity , Debarghya Mukherjee , Moulinath Banerjee , Yuekai Sun

We derive upper and lower bounds on the determinant of an exponential matrix. They can be transformed into corresponding bounds for the determinant of a univariate Gaussian matrix.

Numerical Analysis · Mathematics 2026-03-23 Michael S. Floater

Lower bounds involving $f$-divergences between the underlying probability measures are proved for the minimax risk in estimation problems. Our proofs just use simple convexity facts. Special cases and straightforward corollaries of our…

Statistics Theory · Mathematics 2011-02-22 Adityanand Guntuboyina

The question of defining unique, generally applicable constrained second, and higher-order, derivatives is investigated. It is shown that second-order constrained derivatives obtained via two successive constrained differentiations provide…

Mathematical Physics · Physics 2012-08-14 Tamas Gal

We present a general approach to the problem of determining tight asymptotic lower bounds for generalized central moments of the optimal alignment score of two independent sequences of i.i.d. random variables. At first, these are obtained…

Probability · Mathematics 2016-11-28 Ruoting Gong , Christian Houdré , Jüri Lember

Variational methods play an important role in the study of quantum many-body problems, both in the flavor of classical variational principles based on tensor networks as well as of quantum variational principles in near-term quantum…

Quantum Physics · Physics 2026-02-18 J. Eisert

This paper improves previously known bounds on the determinant of 0-1 matrices where each row has fixed support size. This uses a method based on Scheinerman's, with new analyses to improve upon his conjectures.

Combinatorics · Mathematics 2020-02-11 Justin Semonsen