Ramin Naimi

Ramin Naimi

Auto-generated profile, based on publicly available information

Ramin Naimi

Department of Mathematics, Occidental College, Los Angeles, CA, United States

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 September 2001 in Topology and its Applications
Verified
Journal Article
Closed access
EFErica Flapan
Erica Flapan
RNRamin Naimi
Ramin Naimi
JPJames Pommersheim
James Pommersheim

17 May 2011 in Algebraic & Geometric Topology
Verified
Journal Article
Closed access
EFErica Flapan
Erica Flapan
BMBlake Mellor
Blake Mellor
RNRamin Naimi
Ramin Naimi
We determine for which $m$, the complete graph $K_m$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.Comment: 27 pages, 12 figures; v.2 and v.3 include minor revision

2 January 2014 in Experimental Mathematics
Verified
Journal Article
Closed access
JMJonathan Miller
Jonathan Miller
RNRamin Naimi
Ramin Naimi
We describe an algorithm that recognizes some (possibly all) intrinsically knotted (IK) graphs and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used in [ Goldberg et al. 14 N. [Goldberg et al. 14] Goldberg, T. W. Mattman, and R. Naimi. “Many, Many More Intrinsically Knotted Graphs.” To appear in Algebraic and Geometric Topology, 2014. [Google Scholar] ] to greatly expand the list of known minor minimal IK graphs and to find knotless embeddings for some graphs that had previously resisted attempts to classify them as IK or non-IK.

7 September 2023 in Algebraic & Geometric Topology
Verified
Journal Article
Open access
PDF file
RNRamin Naimi
Ramin Naimi
APAndrei Pavelescu
Andrei Pavelescu
EPElena Pavelescu
Elena Pavelescu
We construct a family of maximal linklessly embeddable graphs on n vertices and 3n 5 edges for all n 10, and another family on n vertices and m < 25 12 n 1 4 edges for all n 13. The latter significantly improves the lowest edge-to-vertex ratio for any previously known infinite family. We construct a family of graphs showing that the class of maximal linklessly embeddable graphs differs from the class of graphs that are maximal without a K 6 minor studied by L Jørgensen. We give necessary and sufficient conditions for when the clique sum of two maximal linklessly embeddable graphs over K 2 , K 3 or K 4 is a maximal linklessly embeddable graph, and use these results to prove our constructions yield maximal linklessly embeddable graphs. 57M15; 05C10

12 April 2024 in Algebraic & Geometric Topology
Verified
Journal Article
Open access
PDF file
TMThomas W Mattman
Thomas W Mattman
RNRamin Naimi
Ramin Naimi
APAndrei Pavelescu
Andrei Pavelescu
EPElena Pavelescu
Elena Pavelescu
It has been an open question whether the deletion or contraction of an edge in an intrinsically knotted graph always yields an intrinsically linked graph. We present a new intrinsically knotted graph that shows the answer to both questions is no. 05C10; 57M15, 57K10

1 January 2021 in Bulletin of the Polish Academy of Sciences. Mathematics
Verified
Journal Article
Closed access
PDF file
TMThomas W. Mattman
Thomas W. Mattman
RNRamin Naimi
Ramin Naimi
BPBenjamin Pagano
Benjamin Pagano