Results 161 to 170 of about 14,970 (213)
Interrelations of graph distance measures based on topological indices. [PDF]
PLoS One, 2014 Dehmer M, Emmert-Streib F, Shi Y.
europepmc +1 more source
On static black holes solutions in Einstein and Einstein-Gauss-Bonnet gravity with topology [Formula: see text]. [PDF]
Eur Phys J C Part Fields, 2015 Dadhich N, Pons JM.
europepmc +1 more source
Local to Global Phenomenon and Other Topics in Probabilistic and Extremal Combinatorics
, 2021 openaire +3 more sources
Counting primes, groups, and manifolds. [PDF]
Proc Natl Acad Sci U S A, 2004 Goldfeld D +3 more
europepmc +1 more source
Products of two atoms in Krull monoids and arithmetical characterizations of class groups.
Eur J Comb, 2013 Baginski P +3 more
europepmc +1 more source
The combinatorics and extreme value statistics of protein threading [PDF]
Annals of Combinatorics, 1999 In protein threading, one is given a protein sequence, together with a database of protein core structures that may contain the natural structure of the sequence. The object of protein threading is to correctly identify the structure(s) corresponding to the sequence.
John L. Spouge +2 more
openalex +2 more sources
Sumsets, Zero-Sums and Extremal Combinatorics [PDF]
, 2006 This thesis develops and applies a method of tackling zero-sum additive questions, especially those related to the Erdos-Ginzburg-Ziv Theorem (EGZ), through the use of partitioning sequences into sets, i.e., set partitions. Much of the research can alternatively be found in the literature spread across nine separate articles, but is here collected into
David J. Grynkiewicz
openalex +2 more sources
Remark on one problem in extremal combinatorics
Problems of Information Transmission, 2012 We reduce the problem of determining the maximum number of permutations of a finite set such that any pair of permutations has at least t common transpositions to the problem of determining the maximum number of permutations of finite set such that any pair has at least t common fixed points. The latter problem was solved by the author in [1].
Vladimir Blinovsky
openalex +2 more sources