activity
20052024
most citedUnstable fingering patterns of Hele-Shaw flows as a dispersionless limit of the KdV hierarchy

27 citations · 165 across the 23 of their papers we have counts for

collaborators

23 papers

math-ph2024★ 1 cited

Projective connections and extremal domains for analytic content

Razvan Teodorescu

This note expands on the recent proof \cite{ABKT} that the extremal domains for analytic content in two dimensions can only be disks and annuli. This result's unexpected implicatio…

math-ph2024★ 1 cited

Integrability-preserving regularizations of Laplacian Growth

Razvan Teodorescu

The Laplacian Growth (LG) model is known as a universality class of scale-free aggregation models in two dimensions, characterized by classical integrability and featuring finite-t…

math-ph2020★ 2 cited

Around a theorem of F. Dyson and A. Lenard: Energy Equilibria for Point Charge Distributions in Classical Electrostatics

Artem Abanov, Nathan Hayford, Dmitry Khavinson +1

We discuss several results in electrostatics: Onsager's inequality, an extension of Earnshaw's theorem, and a result stemming from the celebrated conjecture of Maxwell on the numbe…

math.PR2019★ 1 cited

Effective distribution of codewords for Low Density Parity Check Cycle codes in the presence of disorder

Roshan Warman, Iuliana Teodorescu, Razvan Teodorescu

We review the zeta-function representation of codewords allowed by a parity-check code based on a bipartite graph, and then investigate the effect of disorder on the effective dist…

math.CV2016★ 4 cited

A free boundary problem associated with the isoperimetric inequality

Ar. Abanov, C. Beneteau, D. Khavinson +1

This paper proves a 30 year old conjecture that disks and annuli are the only domains where analytic content - the uniform distance from to analytic functions - achieves…

math.ST2015

Efficient algorithms for topological inference on random graphs

Iuliana Teodorescu, Razvan Teodorescu, Pranav Warman

In this study, we investigate the problem of classifying, characterizing, and designing efficient algorithms for hard inference problems on planar graphs, in the limit of infinite…