Isabella Novik

dblp:95/6438 · DBLP profile ↗
← Back
12ranked-venue papers
5as first author
2since 2021 · last 2026
0000-0003-3695-1337ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 9 · 3 first-author · 1 since 2021Theory of computation · 3 · 2 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Transversal Numbers of Simplicial Polytopes, Spheres, and Pure Complexes
abstract
Abstract. We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and the number of facets and then provide constructions of pure simplicial complexes whose transversal numbers come close to this bound. We introduce a new family of [Formula: see text]-dimensional polytopes that could be considered as “siblings” of cyclic polytopes and show that the transversal ratios of such odd-dimensional polytopes are [Formula: see text]. The previous record for the transversal ratios of [Formula: see text]-polytopes was [Formula: see text]. Finally, we construct infinite families of 3-, 4-, and 5-dimensional simplicial spheres with transversal ratios converging to [Formula: see text], [Formula: see text], and [Formula: see text], respectively. The previous record was [Formula: see text], [Formula: see text], and [Formula: see text], respectively.
Isabella Novik, Hailun Zheng
SIAM J. Discret. Math.1
2024 Affine Stresses: The Partition of Unity and Kalai's Reconstruction Conjectures
Isabella Novik, Hailun Zheng
Discret. Comput. Geom.1
2020 Guest Editors' Foreword
Gil Kalai, Bojan Mohar, Isabella Novik
Discret. Comput. Geom.3
2019 A Lower Bound Theorem for Centrally Symmetric Simplicial Polytopes
Steven Klee, Eran Nevo, Isabella Novik, Hailun Zheng
Discret. Comput. Geom.3
2018 From Acute Sets to Centrally Symmetric 2-Neighborly Polytopes
abstract
What is the maximum number of vertices that a centrally symmetric $2$-neighborly polytope of dimension $d$ can have? It is known that the answer does not exceed $2^d$. Here we provide an explicit construction showing that it is at least $2^{d-1}+2$.
Isabella Novik
SIAM J. Discret. Math.1
2013 Explicit Constructions of Centrally Symmetric k-Neighborly Polytopes and Large Strictly Antipodal Sets
Alexander I. Barvinok, Seung Jin Lee, Isabella Novik
Discret. Comput. Geom.3
2013 From Flag Complexes to Banner Complexes
abstract
A notion of an $i$-banner simplicial complex is introduced. For various values of $i$, these complexes interpolate between the class of flag complexes and the class of all simplicial complexes. Examples of simplicial spheres of an arbitrary dimension that are $(i+1)$-banner but not $i$-banner are constructed. It is shown that several theorems for flag complexes have appropriate $i$-banner analogues. Among them are (1) the codimension-$(i+j-1)$ skeleton of an $i$-banner homology sphere $\Delta$ is $2(i+j)$-Cohen--Macaulay for all $0\leq j\leq \dim\Delta+1-i$, and (2) for every $i$-banner simplicial complex $\Delta$ there exists a balanced complex $\Gamma$ with the same number of vertices as $\Delta$ whose face numbers of dimension $i-1$ and higher coincide with those of $\Delta$.
Steven Klee, Isabella Novik
SIAM J. Discret. Math.2
2009 Applications of Klee's Dehn-Sommerville Relations
Isabella Novik, Ed Swartz
Discret. Comput. Geom.1
2008 A Centrally Symmetric Version of the Cyclic Polytope
Alexander I. Barvinok, Isabella Novik
Discret. Comput. Geom.2
2006 How Neighborly Can a Centrally Symmetric Polytope Be?
Nathan Linial, Isabella Novik
Discret. Comput. Geom.2
2002 A Short Simplicial h-Vector and the Upper Bound Theorem
Patricia Hersh, Isabella Novik
Discret. Comput. Geom.2
2000 A Note on Geometric Embeddings of Simplicial Complexes in a Euclidean Space
Isabella Novik
Discret. Comput. Geom.1