Results 11 to 20 of about 1,003,788 (328)
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, 2011 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 on the marginal (single variable) distributions.
Foster, D.V., Grassberger, P.
openaire +6 more sources
Monotone Projection Lower Bounds from Extended Formulation Lower Bounds [PDF]
, 2015 Published in Theory of Computing, Volume 13 (2017), Article 18; Received: November 10, 2015, Revised: July 27, 2016, Published: December 22 ...
Grochow, Joshua A.
openaire +5 more sources
Raising NP lower bounds to parallel NP lower bounds [PDF]
ACM SIGACT News, 1997 This issue's column surveys recent progress in raising NP-hardness lower bounds to parallel NP lower bounds. Complexity theorists will learn that Lewis Carroll (unbeknownst to himself) was a fellow complexity theorist. So that readers specializing in algorithms don't feel left out, let me mention that they are in even better company.
Hemaspaandra, Edith +2 more
openaire +2 more sources
Two lower bounds for $p$-centered colorings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Given a graph $G$ and an integer $p$, a coloring $f : V(G) \to \mathbb{N}$ is \emph{$p$-centered} if for every connected subgraph $H$ of $G$, either $f$ uses more than $p$ colors on $H$ or there is a color that appears exactly once in $H$. The notion of $
Loïc Dubois +4 more
doaj +1 more source
Discrete Analysis, 2023 New lower bounds for cap sets, Discrete Analysis 2023:20, 18 pp. One of the best known problems in additive combinatorics, the cap set problem, asks how large a subset of $\mathbb F_3^n$ can be if it contains no non-trivial solutions to the equation $x ...
Fred Tyrrell
doaj +1 more source
AIMS Mathematics, 2023 In this paper, we consider an initial-boundary value parabolic problem under nonlinear Neumann boundary conditions. By virtue of the modified differential inequality, lower bounds for the blow-up time of the solution are derived in higher dimensional ...
Zhanwei Gou, Jincheng Shi
doaj +1 more source
Almost Periodic Solutions of First-Order Ordinary Differential Equations
Mathematics, 2018 Approaches to estimate the number of almost periodic solutions of ordinary differential equations are considered. Conditions that allow determination for both upper and lower bounds for these solutions are found.
Seifedine Kadry +3 more
doaj +1 more source
Resonances and lower resolvent bounds [PDF]
, 2014 We show how the presence of resonances close to the real axis implies exponential lower bounds on the norm of the cut-off resolvent on the real axis.Comment: 13 pages, 3 ...
Datchev, Kiril +2 more
core +1 more source
DLP in semigroups: Algorithms and lower bounds
Journal of Mathematical Cryptology, 2022 The discrete logarithm problem (DLP) in semigroups has attracted some interests and serves as the foundation of many cryptographic schemes. In this work, we study algorithms and lower bounds for DLP in semigroups.
Han Jiao, Zhuang Jincheng
doaj +1 more source