Results 31 to 40 of about 734,348 (361)

Upper and lower bounds for $F_v(4,4;5)$ [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2010
In this note we give a computer assisted proof showing that the unique $(5,3)$-Ramsey graph is the unique $K_5$-free graph of order 13 giving $F_v(3,4;5) \leq 13$, then we prove that $17 \leq F_v(2,2,2, 4; 5) \leq F_v(4, 4; 5) \leq 23$. This improves the previous best bounds $16 \leq F_v(4, 4; 5) \leq 25$ provided by Nenov and Kolev.
Xu, Xiaodong, Luo, Haipeng, Shao, Zehui
openaire   +2 more sources

Comparison of an improved self-consistent lower bound theory with Lehmann’s method for low-lying eigenvalues

open access: yesScientific Reports, 2021
Ritz eigenvalues only provide upper bounds for the energy levels, while obtaining lower bounds requires at least the calculation of the variances associated with these eigenvalues. The well-known Weinstein and Temple lower bounds based on the eigenvalues
Miklos Ronto   +2 more
doaj   +1 more source

Lower and Upper Bounds of Fractional Metric Dimension of Connected Networks

open access: yesFractal and Fractional, 2021
The distance centric parameter in the theory of networks called by metric dimension plays a vital role in encountering the distance-related problems for the monitoring of the large-scale networks in the various fields of chemistry and computer science ...
Muhammad Javaid   +5 more
doaj   +1 more source

Tail Bounds for the Wiener Index of Random Trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2007
Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees are given. For upper bounds the moment generating function of the vector of Wiener index and internal path length is estimated.
Tämur Ali Khan, Ralph Neininger
doaj   +1 more source

Opinion formation with upper and lower bounds [PDF]

open access: yes, 2015
We investigate the opinion formation with upper and lower bounds. We formulate the binary exchange of opinions between two individuals, and effects of the self-thinking and political party using the relativistic Boltzmann-Vlasov type equation with the ...
Martin, Arnaud, Yano, Ryosuke
core   +1 more source

Global and blow-up solutions for a nonlinear reaction diffusion equation with Robin boundary conditions

open access: yesBoundary Value Problems, 2020
In the paper, we investigate global and blow-up solutions for a class of nonlinear reaction diffusion equations with Robin boundary conditions. By using auxiliary functions and a first-order differential inequality technique, we establish conditions on ...
Huimin Tian, Lingling Zhang
doaj   +1 more source

Upper and lower bounds on gravitational entropy [PDF]

open access: yesJournal of Cosmology and Astroparticle Physics, 2008
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

Method of intermediate problems in the theory of Gaussian quantum dots placed in a magnetic field

open access: yesCondensed Matter Physics, 2006
Applicability of the method of intermediate problems to the investigation of the energy eigenvalues and eigenstates of a quantum dot (QD) formed by a Gaussian confining potential in the presence of an external magnetic field is discussed. Being smooth at
A.V.Soldatov   +2 more
doaj   +1 more source

Reduced Complexity Filtering with Stochastic Dominance Bounds: A Convex Optimization Approach [PDF]

open access: yes, 2014
This paper uses stochastic dominance principles to construct upper and lower sample path bounds for Hidden Markov Model (HMM) filters. Given a HMM, by using convex optimization methods for nuclear norm minimization with copositive constraints, we ...
Ieee Cristian   +2 more
core   +1 more source

Classical Lower Bounds from Quantum Upper Bounds [PDF]

open access: yes2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018
46 pages; to appear at FOCS ...
Ben-David, Shalev   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy