Eric Tal Myzelev

PhD Student in Algorithms, Combinatorics, and Optimization at Carnegie Mellon University

Eric Tal Myzelev standing beside a lake in the mountains

About

I am a second year PhD student in the Algorithms, Combinatorics, and Optimization (ACO) program at Carnegie Mellon University, where I am grateful to be advised by Nina Balcan. My research is supported by the National Science Foundation Graduate Research Fellowship.

Previously, I completed my undergraduate and master's degrees in Mathematics at the University of Pennsylvania, where I was advised by Florian Pop. My thesis was an expository thesis on Dessins d'Enfants in Algebraic Geometry.

Research

2025

Roots of Real-Valued Zero Mean Maps

Francesca Cantor, Julia D'Amico, Florian Frick, Eric Myzelev

European Journal of Mathematics, 2025

Abstract

We develop a novel topological framework that yields results constraining the distribution of zeros of certain zero mean real-valued maps, namely those obtained from composing a fixed equivariant map with linear functionals. We use this framework to establish upper bounds for the topology of set systems in the domain where (multivariate) trigonometric polynomials do not change their sign, generalizing and, in certain regimes, strengthening results in the literature. Our results more generally contain restrictions on the distribution of zeros of Chebyshev spaces as special cases. Lastly, we apply this framework to derive existence results for efficient cubature rules for compositions of affine functionals and equivariant maps.

2024

A New Class of Geometrically Defined Hypergraphs Arising from the Hadwiger-Nelson Problem

Sean Fiscus, Eric Myzelev, Hongyi Zhang

Geombinatorics Quarterly, 2024

Abstract

There is a famous problem in geometric graph theory to find the chromatic number of the unit distance graph on Euclidean space; it remains unsolved. A theorem of Erdos and De-Bruijn simplifies this problem to finding the maximum chromatic number of a finite unit distance graph. Via a construction built on sequential finite graphs obtained from a generalization of this theorem, we have found a class of geometrically defined hypergraphs of arbitrarily large edge cardinality, whose proper colorings exactly coincide with the proper colorings of the unit distance graph on ℝd. We also provide partial generalizations of this result to arbitrary real normed vector spaces.

2024

Characterization of Colorings Obtained by a Method of Szlam

Eric Myzelev

Geombinatorics Quarterly, 2024

Abstract

Szlam's Lemma is a powerful tool for obtaining upper bounds on the chromatic numbers of distance graphs in normed vector spaces. We introduce and provide a complete characterization for a regimented variety of colorings obtained by the lemma, which we called "ordered Szlam colorings".

2024

Transfer Learning on Physics-Informed Neural Networks for Tracking the Hemodynamics in the Evolving False Lumen of Dissected Aorta

Mitchell Daneker, Shengze Cai, Ying Qian, Eric Myzelev, Arsh Kumbhat, He Li, Lu Lu

Nexus, 2024

Abstract

Aortic dissection is a life-threatening condition where a tear occurs in the inner layer of the aorta. In this study, we propose a new computational framework called warm-start physics-informed neural networks (WS-PINNs). WS-PINNs use neural networks leveraging external MRI data to approximate solutions to the Navier-Stokes equations, thereby generating a detailed model of the hemodynamics inside the evolving false lumen. By incorporating transfer learning, our method efficiently assesses patient-specific risks and complex flow dynamics without the computational cost of modeling the entire vessel structure, offering a promising tool for clinical prognosis.

Contact

I am always open to chatting about math/cs and discussing research problems. Reach out to me!