10.9k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of MichiganUS1.5k papers
- Michigan State UniversityUS1.5k papers
- Centre National de la Recherche ScientifiqueFR1.4k papers
- Lawrence Berkeley National LaboratoryUS1.4k papers
- McGill UniversityCA1.4k papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR1.3k papers
- University of ManchesterGB1.3k papers
- University of LiverpoolGB1.3k papers
- University of TorontoCA1.3k papers
- University of OxfordGB1.3k papers
- TRIUMFCA1.3k papers
- Argonne National LaboratoryUS1.3k papers
6 papers · 2 filters
Kochen-Specker sets and Hadamard matrices
Petr Lisonek
We introduce a new class of complex Hadamard matrices which have not been studied previously. We use these matrices to construct a new infinite family of parity proofs of the Koche…
Bijections for Weyl Chamber walks ending on an axis, using arc diagrams and Schnyder woods
Julien Courtiel, Éric Fusy, Mathias Lepoutre +1
In the study of lattice walks there are several examples of enumerative equivalences which amount to a trade-off between domain and endpoint constraints. We present a family of suc…
Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups?
Andrei A. Bulatov, Olga Karpova, Arseny M. Shur +1
The words separation problem, originally formulated by Goralcik and Koubek (1986), is stated as follows. Let be the minimum number such that for any two words of length $\…
Weighted Lattice Walks and Universality Classes
Julien Courtiel, Stephen Melczer, Marni Mishna +1
In this work we consider two different aspects of weighted walks in cones. To begin we examine a particular weighted model, known as the Gouyou-Beauchamps model. Using the theory o…
Spectral radius and fractional matchings in graphs
Suil O
A {\it fractional matching} of a graph is a function giving each edge a number in so that for each , where is the s…
Interlacing families and the Hermitian spectral norm of digraphs
Gary Greaves, Bojan Mohar, O Suil
It is proved that for any finite connected graph , there exists an orientation of such that the spectral radius of the corresponding Hermitian adjacency matrix is smaller or…