557 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Goddard Space Flight CenterUS13 papers
- Argonne National LaboratoryUS12 papers
- Columbia UniversityUS12 papers
- Center for Astrophysics Harvard & SmithsonianUS11 papers
- Northwestern UniversityUS10 papers
- University of VirginiaUS10 papers
- Space Telescope Science InstituteUS9 papers
- Stockholm UniversitySE8 papers
- University of Notre DameUS8 papers
- Sam Houston State UniversityUS7 papers
- University of TorontoCA7 papers
- Australian National UniversityAU6 papers
12 papers · 1 filter
On the -base of Finite Lattices: Semidistributive, Modular, and Geometric Lattices
Kira Adaricheva, Simon Vilmin
Implicational bases are a well-known representation of closure spaces and their closure lattices. This representation is not unique, though, and a closure space usually admits mult…
A natural bijection for contiguous pattern avoidance in words
Julia Carrigan, Isaiah Hollars, Eric Rowland
Two words and are avoided by the same number of length- words, for all , precisely when and have the same set of border lengths. Previous proofs of this theor…
The lexicographically least square-free word with a given prefix
Siddharth Berera, Andrés Gómez-Colunga, Joey Lakerdas-Gayle +6
The lexicographically least square-free infinite word on the alphabet of non-negative integers with a given prefix is denoted . When is the empty word, this word was…
On the maximum area of inscribed polygons
Dan Ismailescu, Min Jung Kim, Eric Wang
Given a convex -gon and a positive integer such that , let denote the largest area convex -gon contained in . We are interested in the minimum v…
Convex geometries representable by at most 5 circles on the plane
PolyMath REU Convex Geometries Collaboration, Kira Adaricheva, Madina Bolat +18
A convex geometry is a closure system satisfying the anti-exchange property. In this work we document all convex geometries on 4- and 5-element base sets with respect to their repr…
Avoiding 5/4-powers on the alphabet of nonnegative integers
Eric Rowland, Manon Stipulanti
We identify the structure of the lexicographically least word avoiding 5/4-powers on the alphabet of nonnegative integers. Specifically, we show that this word has the form $p τ(φ(…
A -chromatic two-distance graph in the plane
Geoffrey Exoo, Dan Ismailescu
We prove that if one colors each point of the Euclidean plane with one of five colors, then there exist two points of the same color that are either distance or distance ap…
Description of closure operators in convex geometries of segments on a line
Kira Adaricheva, Gent Gjonbalaj
Convex geometry is a closure space with the anti-exchange property. A classical result of Edelman and Jamison (1985) claims that every finite convex geometry is a join of s…
The Hadwiger-Nelson problem with two forbidden distances
Geoffrey Exoo, Dan Ismailescu
In 1950 Edward Nelson asked the following simple-sounding question: \emph{How many colors are needed to color the Euclidean plane such that no two points distance $1…
The chromatic number of the plane is at least 5 - a new proof
Geoffrey Exoo, Dan Ismailescu
We present an alternate proof of the fact that given any 4-coloring of the plane there exist two points unit distance apart which are identically colored.
Avoiding fractional powers over the natural numbers
Lara Pudwell, Eric Rowland
We study the lexicographically least infinite -power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closel…
The Symbolic Dynamics of Tiling the Integers
Ethan M. Coven, William Geller, Sylvia Silberger +1
A finite collection of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of . We associate with such a tiling a d…