Results 21 to 30 of about 60,982 (263)
Multiple Packing: Lower and Upper Bounds
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set $\mathcal{C}$ of points in $ \mathbb{R}^n $ such that any point in $ \mathbb{R}^n $ lies in the intersection of ...
Yihan Zhang 0001, Shashank Vatedka
openaire +2 more sources
Lower and Upper Bounds for Linkage Discovery [PDF]
For a real-valued function f defined on {0,1}n , the linkage graph of f is a hypergraph that represents the interactions among the input variables with respect to f . In this paper, lower and upper bounds for the number of function evaluations required to discover the linkage graph are rigorously analyzed in the black box scenario. First, a lower bound
Choi, SS +2 more
openaire +3 more sources
Some lower and upper bounds on the third ABC index
Atom-bond connectivity (ABC) index has been applied up to now to study the stability of alkanes and the strain energy of cycloalkanes. Graovac defined the second ABC index as ABC2(G)=∑vivj∈E(G)1ni+1nj−2ninj, and Kinkar studied the upper bounds.
Dae-Won Lee
doaj +1 more source
Upper and lower bounds on gravitational entropy [PDF]
The gravitational entropy of the Universe is large and subtle to calculate. A lower bound is well known from supermassive black holes at the centers of galaxies, but the remainder is harder to pin down. A parametric model of clumped matter entropy is provided.
Frampton, Paul H., Kephart, Thomas W.
openaire +2 more sources
Lower and upper bounds for entanglement of Rényi-α entropy
Entanglement Rényi-α entropy is an entanglement measure. It reduces to the standard entanglement of formation when α tends to 1. We derive analytical lower and upper bounds for the entanglement Rényi-α entropy of arbitrary dimensional bipartite quantum ...
Wei Song, Lin Chen, Zhuo-Liang Cao
doaj +1 more source
Dependence Uncertainty Bounds for the Expectile of a Portfolio
We study upper and lower bounds on the expectile risk measure of risky portfolios when the joint distribution of the risky components is not fully specified.
Edgars Jakobsons, Steven Vanduffel
doaj +1 more source
Lower and upper bounds of shortest paths in reachability graphs
We prove the following property for safe marked graphs, safe conflict-free Petri nets, and live and safe extended free-choice Petri nets. We prove the following three results. If the Petri net is a marked graph, then the length of the shortest path is at
P. K. Mishra
doaj +1 more source
Gilbreath Equation, Gilbreath Polynomials, and Upper and Lower Bounds for Gilbreath Conjecture
Let S=s1,…,sn be a finite sequence of integers. Then, S is a Gilbreath sequence of length n, S∈Gn, iff s1 is even or odd and s2,…,sn are, respectively, odd or even and minKs1,…,sm≤sm+1≤maxKs1,…,sm,∀m∈1,n.
Riccardo Gatti
doaj +1 more source
Upper and Lower Bounds of Scattering Phases [PDF]
A general method is developed for a rigorous estimation to upper and lower bounds of scattering phases in the variational methods applied to one-dimensional problems. It is also possible to estimate the mean error of the approximate wave function itself.
openaire +2 more sources

