Results 91 to 100 of about 6,526 (216)
Combinatorics of Free Cumulants
Journal of Combinatorial Theory, Series A, 2000 26 pages ...
Bernadette Krawczyk, Roland Speicher
openaire +3 more sources
Journal of Topology, Volume 19, Issue 3, September 2026.Abstract We give a formula with explicit constants relating the subsurface projection dY(ν−,ν+)$d_Y(\nu ^-,\nu ^+)$ of the end invariants ν−,ν+$\nu ^-,\nu ^+$ of a hyperbolic 3‐manifold Q$Q$ diffeomorphic to S×R$S\times \mathbb {R}$ and the length of the geodesic representative in Q$Q$ of the multicurve ∂Y$\partial Y$.
Gabriele Viaggi
wiley +1 more source
Determinants, choices and combinatorics [PDF]
Discrete Mathematics, 2019 We prove a formula which generalizes both Onn's colorful determinantal formula, related to Rota's basis conjecture, and Svrtan's $n!$ formula, related to the Atiyah-Sutcliffe problem. In some cases, our formula allows us to prove some results similar in spirit to the statement of Rota's basis conjecture.
openaire +2 more sources
Geophysical Research Letters, Volume 53, Issue 16, 28 August 2026.Abstract The annual mean Surface Air Temperature (SAT) observed during 1757–1762 in central Beijing was 3.1°C lower than that of the nearby Autonomous Weather Stations (AWS) in recent 6 years (2015–2020). The change was much larger than the averaged global warming of the past century.
Guoyu Ren +4 more
wiley +1 more source
The power of many: when genetics met yeasts and high‐throughput
Biological Reviews, Volume 101, Issue 4, Page 1662-1682, August 2026.ABSTRACT In recent years, complex technological capabilities have evolved, driven by the need to solve complex and integrative biological questions through global analyses. New equipment allows the scaling up and automation of processes which previously were carried out on a very limited scale.
Víctor A. Tallada, Víctor Carranco
wiley +1 more source
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 388-409, August 2026.ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n is a set of Hamiltonian cycles in which each 1‐path of K n appears exactly once. A Dudeney set of K n is a set of Hamiltonian cycles in which each 2‐path of K n appears exactly once. Kotzig's perfect set of HCDs of K n is a set of HCDs whose union forms a Dudeney set.
Nobuaki Mutoh
wiley +1 more source
Discrete Mathematics, 2002 This nice survey paper gives a short introduction into Daniel Kleitman's seminal contributions to combinatorics, with special emphasis on extremal hypergraph theory, asymptotic enumerations, and discrete geometry.
openaire +2 more sources
Structure and Randomness in Combinatorics [PDF]
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007 13 pages, no figures. FOCS 2007 tutorial notes.
openaire +3 more sources
Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 361-377, August 2026.ABSTRACT The Oberwolfach problem OP ( F ), for a 2‐factor F of K n, asks whether there exists a 2‐factorization of K n (if n is odd) or K n − I (if n is even) where each 2‐factor is isomorphic to F. Here, I denotes any 1‐factor of K n. For even n, the problem OP ( F ) may also be denoted OP − ( F ), and has been nicknamed the spouse‐avoiding variant ...
Maruša Lekše, Mateja Šajna
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