Results 111 to 120 of about 145,190 (272)
Ore's theorem on subfactor planar algebras
, 2019 This article proves that an irreducible subfactor planar algebra with a distributive biprojection lattice admits a minimal 2-box projection generating the identity biprojection.
Palcoux, Sebastien
core
Moments of the Riemann zeta function at its local extrema
Mathematika, Volume 71, Issue 4, October 2025.Abstract Conrey, Ghosh and Gonek studied the first moment of the derivative of the Riemann zeta function evaluated at the non‐trivial zeros of the zeta function, resolving a problem known as Shanks' conjecture. Conrey and Ghosh studied the second moment of the Riemann zeta function evaluated at its local extrema along the critical line to leading order.
Andrew Pearce‐Crump
wiley +1 more source
On Generalized Avicenna Numbers
Mathematical Methods in the Applied Sciences, Volume 48, Issue 14, Page 13300-13316, 30 September 2025.ABSTRACT Avicenna numbers that we define in this paper, are a class of figurate numbers, including icosahedral, octahedral, tetrahedral, dodecahedral, rhombicosidodecahedral numbers and cubes, play a key role in mathematics, physics and various scientific fields.
Melih Göcen, Yüksel Soykan
wiley +1 more source
Combinatorics of Free Cumulants
Journal of Combinatorial Theory, Series A, 2000 26 pages ...
Bernadette Krawczyk, Roland Speicher
openaire +4 more sources
Strong External Difference Families and Classification of α‐Valuations
Journal of Combinatorial Designs, Volume 33, Issue 9, Page 343-356, September 2025.ABSTRACT One method of constructing ( a 2 + 1 , 2 , a , 1 )‐SEDFs (i.e., strong external difference families) in Z a 2 + 1 makes use of α‐valuations of complete bipartite graphs K a , a. We explore this approach and we provide a classification theorem which shows that all such α‐valuations can be constructed recursively via a sequence of “blow‐up ...
Donald L. Kreher +2 more
wiley +1 more source
Enumeration and Construction of Row‐Column Designs
Journal of Combinatorial Designs, Volume 33, Issue 9, Page 357-372, September 2025.ABSTRACT We computationally completely enumerate a number of types of row‐column designs up to isotopism, including double, sesqui, and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO‐arrays. We calculate autotopism group sizes for the designs we generate.
Gerold Jäger +3 more
wiley +1 more source
Rainbow Connection Number of Dense Graphs
Discussiones Mathematicae Graph Theory, 2013 An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to ...
Li Xueliang +2 more
doaj +1 more source
A Note on the generating function of p-Bernoulli numbers
, 2018 We use analytic combinatorics to give a direct proof of the closed formula for the generating function of $p$-Bernoulli numbers.Comment: 6 ...
Kuba, Markus
core
Some asymptotic methods in combinatorics [PDF]
, 1979 J. M. Plotkin, John W. Rosenthal
openalex +1 more source
Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems
Journal of Graph Theory, Volume 110, Issue 1, Page 59-71, September 2025.ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh +2 more
wiley +1 more source