works on

From the 1 of 14 linked papers with an AI index.

collaborators

14 papers

math.AT2026

Antipodal paths in covers of spheres

David Ellis, Maria-Romina Ivan, Imre Leader +1

The authors prove that if an n‑dimensional sphere is covered by k open sets with n ≥ 2k‑2, then one of the sets must contain a path whose endpoints are antipodal, and they show thi…

math.CO2026

Optimal Embeddings of Posets in Hypercubes

Tomáš Flídr, Maria-Romina Ivan, Sean Jaffe

Given a finite poset , the hypercube-height, denoted by , is defined to be the minimum such that there exists a natural number for which the su…

math.CO2026

Generalised Prisms and Euclidean Ramsey Theory

Maria-Romina Ivan, Imre Leader, Mark Walters

A finite subset of is called Ramsey if for every there exists an such that whenever is -coloured there exists a monochromatic congruent c…

math.CO2026

Gluing Posets and the Dichotomy of Poset Saturation Numbers

Maria-Romina Ivan, Sean Jaffe

Given a finite poset , we say that a family of subsets of is -saturated if does not contain an induced copy of ,…

math.CO2026

Linear Saturation for via Butterflies

Maria-Romina Ivan, Nandi Wang

Given a finite poset , how small can a family of subsets of be such that does not contain an induced copy of , but $\mathcal…

math.CO2026

The Exact Saturation Number for the Diamond

Maria-Romina Ivan, Sean Jaffe

What is the smallest size of a family of subsets of such that it does not contain an induced copy of as a poset (known as the \textit{diamond}), but adding a new set cr…