相关论文: Graphs of continuous but non-affine functions are …
While self-similar sets have no tangents at any single point, self-affine curves can be smooth. We consider plane self-affine curves without double points and with two pieces. There is an open subset of parameter space for which the curve…
In this note, we prove that smooth self-shrinkers in $\Real^{n+1}$, that are entire graphs, are hyperplanes. Previously Ecker and Huisken showed that smooth self-shrinkers, that are entire graphs and have at most polynomial growth, are…
A drawing of a graph is fan-planar if the edges intersecting a common edge $a$ share a vertex $A$ on the same side of $a$. More precisely, orienting $e$ arbitrarily and the other edges towards $A$ results in a consistent orientation of the…
We say that a plane set $A$ is {\it graph-null,} if there is a function $g\colon [0,1] \to \mathbb{R}$ such that $\lambda_2 (A+{\rm graph}\, g)=0$. A plane set $A$ has the {\it translational Kakeya property} if, for every translated copy…
A graph is \emph{fan-crossing free} if it has a drawing in the plane so that each edge is crossed by independent edges, that is the crossing edges have distinct vertices. On the other hand, it is \emph{fan-crossing} if the crossing edges…
Self-shrinkers are hypersurfaces that shrink homothetically under mean curvature flow; these solitons model the singularities of the flow. It it presently known that an entire self-shrinking graph must be a hyperplane. In this paper we show…
Every finite graph admits a \emph{simple (topological) drawing}, that is, a drawing where every pair of edges intersects in at most one point. However, in combination with other restrictions simple drawings do not universally exist. For…
We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…
We consider the problem of stretching pseudolines in a planar straight-line drawing to straight lines while preserving the straightness and the combinatorial embedding of the drawing. We answer open questions by Mchedlidze et al. by showing…
Motivated by the analogy between number fields and function fields, this paper extends the main result of \cite{janbazi2025unified} to the function field setting. Let $C$ be a smooth affine curve over a finite field, and let $\pi: S…
A graph is 1-planar if it can be drawn in the plane so that each edge is crossed at most once. However, there are 1-planar graphs which do not admit a straight-line 1-planar drawing. We show that every 1-planar graph has a straight-line…
We prove that the theory of the Farey graph is pseudofinite by constructing a sequence of finite structures that satisfy increasingly large subsets of its first-order axiomatization. This graph is an important object in the study of curve…
Previously, we have investigated a natural smooth map onto the region surrounded by the graphs of two smooth real-valued functions in the plane converging to a same value or diverges to $+\infty$ or $-\infty$ simultaneously, at each…
We prove that after an arbitrarily small adjustment of edge lengths, the spectrum of a compact quantum graph with $\delta$-type vertex conditions can be simple. We also show that the eigenfunctions, with the exception of those living…
For any graph $G$ on $n$ vertices and for any {\em symmetric} subgraph $J$ of $K_{n,n}$, we construct an infinite sequence of graphs based on the pair $(G,J)$. The First graph in the sequence is $G$, then at each stage replacing every…
We show that every continuous simple curve with $\sigma$-finite length has a tangent at positively many points. We also apply this result to functions with finite lower scaled oscillation; and study the validity of the results in higher…
Given a function f in the exterior of a convex curve in the real plane, we prove that if the restrictions of f to the tangent lines to the curve extend as entire functions, then the function f is an entire function of two variables.
We characterize embedded $\C^1$ hypersurfaces of $\R^n$ as the only locally closed sets with continuously varying flat tangent cones whose measure-theoretic-multiplicity is at most $m<3/2$. It follows then that any (topological)…
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…
A fan is a set of edges with a single common endpoint. A graph is fan-crossing if it admits a drawing in the plane so that each edge is crossed by edges of a fan. It is fan-planar if, in addition, the common endpoint is on the same side of…