Related papers: Intersections of Amoebas
A hypermap is an embedding of a connected hypergraph into an orientable closed surface. A covering between hypermaps is a homomorphism between the embedded hypergraphs which extends to an orientation-preserving covering of the supporting…
The intersection index at a common point of two analytic varieties of complementary dimensions in $\Bbb C^n$ is positive. This observation, which has been called a ``cornerstone'' of algebraic geometry ([GH, p.~62]), is a simple consequence…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
We apply methods of machine-learning, such as neural networks, manifold learning and image processing, in order to study 2-dimensional amoebae in algebraic geometry and string theory. With the help of embedding manifold projection, we…
We study the non-archimedean counterpart to the complex amoeba of an algebraic variety, and show that it coincides with a polyhedral set defined by Bieri and Groves using valuations. For hypersurfaces this set is also the tropical variety…
We study some basic algorithmic problems concerning the intersection of tropical hypersurfaces in general dimension: deciding whether this intersection is nonempty, whether it is a tropical variety, and whether it is connected, as well as…
We introduce a new multiplication for the polytope algebra, defined via the intersection of polytopes. After establishing the foundational properties of this intersection product, we investigate finite-dimensional subalgebras that arise…
There exists a dictionary between hereditary orders and smooth stacky curves, resp. tame orders of global dimension 2 and Azumaya algebras on smooth stacky surfaces. We extend this dictionary by explaining how the restriction of a tame…
We compute the expected multivolume of the amoeba of a random half dimensional complete intersection in $\mathbb{CP}^{2n}$. We also give a relative generalization of our result to the toric case.
We get sharp degree bound for generic smoothness and connectedness of the space of conics in low degree complete intersections which generalizes the old work about Fano scheme of lines on Hypersurfaces.
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…
In \cite{botero}, a top intersection product of toric b-divisors on a smooth complete toric variety is defined. It is shown that a nef toric b-divisor corresponds to a convex set and that its top intersection number equals the volume of…
Closed form expressions are given for computing the parameters and vectors that identify and define the $n-1$ dimensional conic section that results from the intersection of a hyperplane with an $n$-dimensional conic section: cone,…
We study the intersection theory of punctured pseudoholomorphic curves in $4$-dimensional symplectic cobordisms. We first study the local intersection properties of such curves at the punctures. We then use this to develop topological…
We study the analytic and topological invariants associated with complex normal surface singularities. Our goal is to provide topological formulae for several discrete analytic invariants whenever the analytic structure is generic (with…
Previously, we have systematically constructed explicit real algebraic functions which are represented as the compositions of smooth real algebraic maps whose images are domains surrounded by hypersurfaces of degree 1 or 2 with canonical…
Projecting fields between different meshes commonly arises in computational physics. This operation requires a supermesh construction and its computational cost is proportional to the number of cells of the supermesh $n$. Given any two…
We study contact interactions for long world-lines on a curved surface, focusing on the average number of times two world-lines intersect as a function of their end-points. The result can be used to extend the concept of path-ordering, as…
A graph $G$ with vertex set $\{v_1,v_2,\ldots,v_n\}$ is an intersection graph of segments if there are segments $s_1,\ldots,s_n$ in the plane such that $s_i$ and $s_j$ have a common point if and only if $\{v_i,v_j\}$ is an edge of~$G$. In…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…