Results 11 to 20 of about 86,947 (289)
Radially Excited AdS5 Black Holes in Einstein–Maxwell–Chern–Simons Theory
Entropy, 2017 In the large coupling regime of the 5-dimensional Einstein–Maxwell–Chern–Simons theory, charged and rotating cohomogeneity-1 black holes form sequences of extremal and non-extremal radially excited configurations.
Jose Luis Blázquez-Salcedo
doaj +4 more sources
Rotating black hole in Rastall theory
European Physical Journal C: Particles and Fields, 2018 Rotating black hole solutions in theories of modified gravity are important as they offer an arena to test these theories through astrophysical observation.
Rahul Kumar, Sushant G. Ghosh
doaj +3 more sources
, 2020 We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the resulting set is ...
Grzesik, Andrzej +2 more
core +2 more sources
Freiman's Theorem in Finite Fields via Extremal Set Theory [PDF]
Combinatorics, Probability and Computing, 2009 Using various results from extremal set theory (interpreted in the language of additive combinatorics), we prove an asymptotically sharp version of Freiman's theorem in $\F_2^n$: if $A \subseteq \F_2^n$ is a set for which |A + A| ≤ K|A| then A is contained in a subspace of size $2^{2K + O(\sqrt{K}\log K)}|A|$; except for the $O(\sqrt{K} \log K)$ error,
Green, B, Tao, T
openaire +3 more sources
An extremal problem on trees and database theory [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We consider an extremal problem on labelled directed trees and applications to database theory. Among others, we will show explicit keysystems on an underlying set of size $n$, that cannot be represented by a database of less than $2^{n(1-c\cdot \log ...
Gyula O.H. Katona, Krisztián Tichler
doaj +1 more source
A note on the Ramsey numbers for theta graphs versus the wheel of order 5
AKCE International Journal of Graphs and Combinatorics, 2018 The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F , the Ramsey number R (S , F) is the smallest positive integer r such that for ...
Mohammed M.M. Jaradat +3 more
doaj +2 more sources
Sunflowers and -intersecting families
AKCE International Journal of Graphs and Combinatorics, 2020 Let stand for the least number so that if is an arbitrary -uniform, -intersecting set system, where , and has more than elements, then contains a sunflower with petals. We give an upper bound for .
Gábor Hegedűs
doaj +1 more source
Conformal bootstrap deformations
Journal of High Energy Physics, 2022 We explore the space of extremal functionals in the conformal bootstrap. By recasting the bootstrap problem as a set of non-linear equations parameterized by the CFT data, we find an efficient algorithm for converging to the extremal solution ...
Nima Afkhami-Jeddi
doaj +1 more source
Extremal set theory for the binomial norm [PDF]
Journal of Combinatorial Theory, Series A, 2020 Best possible bounds are established for families without s pairwise disjoint members and the more general problem for several families. The results are shown to apply several classical results.
openaire +2 more sources
Journal of High Energy Physics, 2021 The positivity bounds, derived from the axiomatic principles of quantum field theory (QFT), constrain the signs of Wilson coefficients and their linear combinations in the Standard Model Effective Field Theory (SMEFT).
Kimiko Yamashita +2 more
doaj +1 more source