相关论文: The edge-isorperimetric problem on Sierpinski grap…
We describe various kaleidoscopic and self-similar aspects of the integral Apollonian gaskets - fractals consisting of close packing of circles with integer curvatures. Self-similar recursive structure of the whole gasket is shown to be…
We develop a spectral approach to Sidorenko-type inequalities and apply it to establish sharp edge-spectral supersaturation results. Let $H$ be a bipartite graph with $v$ vertices and $e$ edges, where $v\le e$, and write $M(G)=2e(G)$. We…
In this paper we construct a large family of examples of subsets of Euclidean space that support a 1-Poincar\'e inequality yet have empty interior. These examples are formed from an iterative process that involves removing well-behaved…
We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…
Using classical results of infinite-dimensional geometry, we show that the isometry group of the Urysohn space, endowed with its usual Polish group topology, is homeomorphic to the separable Hilbert space. The proof is basedon a lemma about…
We construct a one-parameter family of Laplacians on the Sierpinski Gasket that are symmetric and self-similar for the 9-map iterated function system obtained by iterating the standard 3-map iterated function system. Our main result is the…
In this paper, we introduce a family of tetravalent graphs called propeller graphs, denoted by $Pr_{n}(b,c,d)$. We then produce three infinite subfamilies and one finite subfamily of arc-transitive propeller graphs, and show that all such…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
The hierarchical graphs and Sierpi\'nski graphs are constructed iteratively, which have the same number of vertices and edges at any iteration, but exhibit quite different structural properties: the hierarchical graphs are non-fractal and…
We describe an infinite family of edge-decompositions of complete graphs into two graphs, each of which triangulate the same orientable surface. Previously, such decompositions had only been known for only a few complete graphs. These…
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…
We find all polyhedral graphs such that their complements are still polyhedral. These turn out to be all self-complementary.
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
We use fine curve graph tools to prove that there exist parabolic isometries of graphs of curves associated to surfaces of infinite type.
Building on work of Farb and the second author, we prove that the group of automorphisms of the fine curve graph for a surface is isomorphic to the group of homeomorphisms of the surface. This theorem is analogous to the seminal result of…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the…
For a given family of similar shapes, what we call a "unit shape" strongly analogizes the role of the unit circle within the family of all circles. Within many such families of similar shapes, we present what we believe is naturally and…
Many problems in Euclidean geometry, arising in computational design and fabrication, amount to a system of constraints, which is challenging to solve. We suggest a new general approach to the solution, which is to start with analogous…
An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…