10.9k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR3.6k papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR3.2k papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR3k papers
- Joint Institute for Nuclear ResearchRU2.7k papers
- Institute for High Energy PhysicsES2.7k papers
- European Organization for Nuclear ResearchCH2.6k papers
- Institut de Recherche sur les Lois Fondamentales de l'UniversFR2.6k papers
- Institute of High Energy PhysicsCN2.6k papers
- Rutherford Appleton LaboratoryGB2.5k papers
- Deutsches Elektronen-Synchrotron DESYDE2.5k papers
- National and Kapodistrian University of AthensGR2.5k papers
- Istituto Nazionale di Fisica Nucleare, Sezione di NapoliIT2.4k papers
5 papers · 2 filters
Non-Holonomicity of Sequences Defined via Elementary Functions
Jason P. Bell, Stefan Gerhold, Martin Klazar +1
We present a new method for proving non-holonomicity of sequences, which is based on results about the number of zeros of elementary and of analytic functions. Our approach is appl…
Knot invariants and the Bollobas-Riordan polynomial of embedded graphs
Iain Moffatt
For a graph G embedded in an orientable surface Σ, we consider associated links L(G) in the thickened surface Σ\times I. We relate the HOMFLY polynomial of L(G) to the recently def…
The enumeration of planar graphs via Wick's theorem
Mihyun Kang, Martin Loebl
A seminal technique of theoretical physics called Wick's theorem interprets the Gaussian matrix integral of the products of the trace of powers of Hermitian matrices as the number…
High-girth cubic graphs are homomorphic to the Clebsch graph
Matt DeVos, Robert Samal
We give a (computer assisted) proof that the edges of every graph with maximum degree 3 and girth at least 17 may be 5-colored (possibly improperly) so that the complement of each…
k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams
Anna de Mier
We give a correspondence between graphs with a given degree sequence and fillings of Ferrers diagrams by nonnegative integers with prescribed row and column sums. In this setting,…