554 citations
- University of CambridgeGB52 papers
- University of OxfordGB27 papers
- University of Illinois Urbana-ChampaignUS16 papers
- Space Telescope Science InstituteUS12 papers
- University of California, IrvineUS12 papers
- California Institute of TechnologyUS11 papers
- Carnegie ObservatoriesUS11 papers
- Flatiron Institute11 papers
- Leiden UniversityNL11 papers
- Université Bourgogne Franche-ComtéFR11 papers
- University of Colorado BoulderUS11 papers
- Center for Astrophysics Harvard & SmithsonianUS10 papers
15 papers · 1 filter
Frustrated Triangles
Teeradej Kittipassorn, Gabor Meszaros
A triple of vertices in a graph is a \emph{frustrated triangle} if it induces an odd number of edges. We study the set of possible number of frustrated…
Random-step Markov processes
Neal Bushaw, Karen Gunderson, Steven Kalikow
We explore two notions of stationary processes. The first is called a random-step Markov process in which the stationary process of states, has a station…
The multiplication table problem for bipartite graphs
Bhargav Narayanan, Julian Sahasrabudhe, István Tomon
We investigate the following generalisation of the 'multiplication table problem' of Erdős: given a bipartite graph with edges, how large is the set of sizes of its induced sub…
Isometries and Hermitian Operators on Zygmund spaces
Fernanda Botelho
In this paper we characterize the isometries of subspaces of the little Zygmund space. We show that the isometries of these spaces are surjective and represented as integral operat…
Intersections of hypergraphs
Béla Bollobás, Alex Scott
Given two weighted k-uniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how conc…
On Three Sets with Nondecreasing Diameter
Daniel Bernstein, David J. Grynkiewicz, Carl R. Yerger
Let denote the integers between and inclusive and, for a finite subset , let the diameter of be equal to . We write $X<…