Optimal Bounds for Multi-Prime Φ-Hiding Assumption

2012 ◽  
pp. 1-14 ◽  
Author(s):  
Kaori Tosu ◽  
Noboru Kunihiro
Keyword(s):  
Optimal Bounds

scholarly journals Mathematical Properties of Variable Topological Indices

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 43
Author(s):  
José M. Sigarreta
Keyword(s):  
Real Number ◽  
Large Class ◽  
Symmetric Functions ◽  
Topological Indices ◽  
Current Interest ◽  
Zagreb Indices ◽  
Mathematical Properties ◽  
Connectivity Indices ◽  
Optimal Bounds ◽  
New Framework

A topic of current interest in the study of topological indices is to find relations between some index and one or several relevant parameters and/or other indices. In this paper we study two general topological indices Aα and Bα, defined for each graph H=(V(H),E(H)) by Aα(H)=∑ij∈E(H)f(di,dj)α and Bα(H)=∑i∈V(H)h(di)α, where di denotes the degree of the vertex i and α is any real number. Many important topological indices can be obtained from Aα and Bα by choosing appropriate symmetric functions and values of α. This new framework provides new tools that allow to obtain in a unified way inequalities involving many different topological indices. In particular, we obtain new optimal bounds on the variable Zagreb indices, the variable sum-connectivity index, the variable geometric-arithmetic index and the variable inverse sum indeg index. Thus, our approach provides both new tools for the study of topological indices and new bounds for a large class of topological indices. We obtain several optimal bounds of Aα (respectively, Bα) involving Aβ (respectively, Bβ). Moreover, we provide several bounds of the variable geometric-arithmetic index in terms of the variable inverse sum indeg index, and two bounds of the variable inverse sum indeg index in terms of the variable second Zagreb and the variable sum-connectivity indices.

scholarly journals Minimax-Optimal Bounds for Detectors Based on Estimated Prior Probabilities

2012 ◽  
Vol 58 (9) ◽  
pp. 6101-6109 ◽  
Author(s):  
Jiantao Jiao ◽  
Lin Zhang ◽  
Robert D. Nowak
Keyword(s):  
Prior Probabilities ◽  
Optimal Bounds

scholarly journals Optimal bounds on finding fixed points of contraction mappings

2010 ◽  
Vol 411 (16-18) ◽  
pp. 1742-1749 ◽  
Author(s):  
Ching-Lueh Chang ◽  
Yuh-Dauh Lyuu
Keyword(s):  
Fixed Points ◽  
Contraction Mappings ◽  
Optimal Bounds

scholarly journals Proof of a conjecture of Granath on optimal bounds of the Landau constants

2016 ◽  
Vol 204 ◽  
pp. 17-33 ◽  
Author(s):  
Chun-Ru Zhao ◽  
Wen-Gao Long ◽  
Yu-Qiu Zhao
Keyword(s):  
Optimal Bounds

scholarly journals Optimal Bounds for the k -cut Problem

2022 ◽  
Vol 69 (1) ◽  
pp. 1-18
Author(s):  
Anupam Gupta ◽  
David G. Harris ◽  
Euiwoong Lee ◽  
Jason Li
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Connected Components ◽  
Small Integer ◽  
Main Ingredient ◽  
Fine Grained ◽  
Optimal Bounds ◽  
Sunflower Lemma ◽  
General Graphs ◽  
New Algorithms

In the k -cut problem, we want to find the lowest-weight set of edges whose deletion breaks a given (multi)graph into k connected components. Algorithms of Karger and Stein can solve this in roughly O ( n 2k ) time. However, lower bounds from conjectures about the k -clique problem imply that Ω ( n (1- o (1)) k ) time is likely needed. Recent results of Gupta, Lee, and Li have given new algorithms for general k -cut in n 1.98k + O(1) time, as well as specialized algorithms with better performance for certain classes of graphs (e.g., for small integer edge weights). In this work, we resolve the problem for general graphs. We show that the Contraction Algorithm of Karger outputs any fixed k -cut of weight α λ k with probability Ω k ( n - α k ), where λ k denotes the minimum k -cut weight. This also gives an extremal bound of O k ( n k ) on the number of minimum k -cuts and an algorithm to compute λ k with roughly n k polylog( n ) runtime. Both are tight up to lower-order factors, with the algorithmic lower bound assuming hardness of max-weight k -clique. The first main ingredient in our result is an extremal bound on the number of cuts of weight less than 2 λ k / k , using the Sunflower lemma. The second ingredient is a fine-grained analysis of how the graph shrinks—and how the average degree evolves—in the Karger process.

Optimal Bounds on the Effective Bulk Modulus of Polycrystals

1989 ◽  
Vol 49 (3) ◽  
pp. 824-837 ◽  
Author(s):  
Marco Avellaneda ◽  
Graeme W. Milton
Keyword(s):  
Bulk Modulus ◽  
Effective Bulk Modulus ◽  
Optimal Bounds
Sign in / Sign up

Export Citation Format

Share Document