Results 11 to 20 of about 996,357 (278)
Lower bounds for incidences with hypersurfaces
Discrete Analysis, 2016 Lower bounds for incidences with hypersurfaces, Discrete Analysis 2016:16, 14pp. A fundamental result in combinatorial geometry, the Szemerédi-Trotter theorem, states that among any $n$ points and $m$ lines in $\mathbb R^2$ there can be at most $O((mn)^{
Adam Sheffer
doaj +2 more sources
Lower Bounds on Mutual Information [PDF]
Physical Review E, 2010 We correct claims about lower bounds on mutual information (MI) between real-valued random variables made in A. Kraskov {\it et al.}, Phys. Rev. E {\bf 69}, 066138 (2004). We show that non-trivial lower bounds on MI in terms of linear correlations depend
David V. Foster +4 more
core +5 more sources
The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices [PDF]
Journal of Inequalities and Applications, 2017 The paper mainly discusses the lower bounds for the rank of matrices and sufficient conditions for nonsingular matrices. We first present a new estimation for ∑ i = 1 n | λ i | 2 $\sum_{i=1}^{n} \vert \lambda_{i} \vert ^{2}$ ( λ i $\lambda_{i}$ is an ...
Dafei Wang, Xumei Zhang
doaj +2 more sources
Monotone Projection Lower Bounds from Extended Formulation Lower Bounds [PDF]
, 2017 In this short note, we reduce lower bounds on monotone projections of polynomials to lower bounds on extended formulations of polytopes. Applying our reduction to the seminal extended formulation lower bounds of Fiorini, Massar, Pokutta, Tiwari, & de ...
Grochow, Joshua A.
core +4 more sources
Lower Bounds for Nonrelativistic Atomic Energies [PDF]
ACS Physical Chemistry Au, 2021 Robbie T. Ireland +5 more
doaj +2 more sources
Lower bounds for the low-rank matrix approximation [PDF]
Journal of Inequalities and Applications, 2017 Low-rank matrix recovery is an active topic drawing the attention of many researchers. It addresses the problem of approximating the observed data matrix by an unknown low-rank matrix. Suppose that A is a low-rank matrix approximation of D, where D and A
Jicheng Li, Zisheng Liu, Guo Li
doaj +2 more sources
Upper and lower bounds for the Bregman divergence [PDF]
Journal of Inequalities and Applications, 2019 In this paper we study upper and lower bounds on the Bregman divergence ΔFξ(y,x):=F(y)−F(x)−〈ξ,y−x〉 $\Delta_{\mathcal {F}}^{\xi }(y,x):=\mathcal {F}(y)-\mathcal {F}(x)- \langle \xi , y-x \rangle$ for some convex functional F $\mathcal {F}$ on a normed ...
Benjamin Sprung
doaj +2 more sources
Lower Bounds on Stabilizer Rank [PDF]
Quantum, 2022 The $\textit{stabilizer rank}$ of a quantum state $\psi$ is the minimal $r$ such that $\left| \psi \right \rangle = \sum_{j=1}^r c_j \left|\varphi_j \right\rangle$ for $c_j \in \mathbb{C}$ and stabilizer states $\varphi_j$.
Shir Peleg, Amir Shpilka, Ben Lee Volk
doaj +1 more source
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016 A general and long-standing belief in the proof complexity community asserts that there is a close connection between progress in lower bounds for Boolean circuits and progress in proof size lower bounds for strong propositional proof systems. Although there are famous examples where a transfer from ideas and techniques from circuit complexity to proof
Olaf Beyersdorff +2 more
+4 more sources
Lower bounds for blow up time of the p-Laplacian equation with damping term [PDF]
Mathematica Moravica, 2021 In this work deals with the p-Laplacian wave equation with damping terms in a bounded domain. Under suitable conditions, we obtain a lower bounds for the blow up time.
Dınç Yavuz +2 more
doaj +1 more source