Related papers: Patchworking real algebraic varieties
We construct a polynomial of degree d in two variables whose Hessian curve has (d-2)^2 connected components using Viro patchworking. In particular, this implies the existence of a smooth real algebraic surface of degree d in RP^3 whose…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
As technology scaling is approaching the physical limit, lithography hotspot detection has become an essential task in design for manufacturability. While the deployment of pattern matching or machine learning in hotspot detection can help…
Haas' theorem describes all partchworkings of a given non-singular plane tropical curve $C$ giving rise to a maximal real algebraic curve. The space of such patchworkings is naturally a linear subspace $W_C$ of the…
An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…
The ability to perform mathematical computations using metastructures is an emergent paradigm that carries the potential of wave-based analog computing to the realm of near-speed-of-light, low-loss, compact devices. We theoretically…
This paper provides applications of patching to quadratic forms and central simple algebras over function fields of curves over henselian valued fields. In particular, we use a patching approach to reprove and generalize a recent result of…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
The Massive Parallel Computation (MPC) model is a theoretical framework for popular parallel and distributed platforms such as MapReduce, Hadoop, or Spark. We consider the task of computing a large matching or small vertex cover in this…
Motivated by questions in biological classification, we discuss some elementary combinatorial and computational properties of certain set systems that generalize hierarchies, namely, 'patchworks', 'weak patchworks', 'ample patchworks' and…
We consider the problem of answering connectivity queries on a real algebraic curve. The curve is given as the real trace of an algebraic curve, assumed to be in generic position, and being defined by some rational parametrizations. The…
The accurate and efficient computation of the electromagnetic response of objects made from artificial materials is crucial for designing photonic functionalities and interpreting experiments. Advanced fabrication techniques can nowadays…
On logarithmic paper some real algebraic curves look like smoothed broken lines. Moreover, the broken lines can be obtained as limits of those curves. The corresponding deformation can be viewed as a quantization, in which the broken line…
In this text, we study Viro's conjecture and related problems for real algebraic surfaces in $(\mathbb{CP}^1)^3$. We construct a counter-example to Viro's conjecture in tridegree $(4,4,2)$ and a family of real algebraic surfaces of…
Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…
A graph is said to be rigid if, given a generic realisation of the graph as a bar-and-joint framework in the plane, there exist only finitely many other realisations of the graph with the same edge lengths modulo rotations, reflections and…
Finding coarse representations of large graphs is an important computational problem in the fields of scientific computing, large scale graph partitioning, and the reduction of geometric meshes. Of particular interest in all of these fields…
Assembling parts into an object is a combinatorial problem that arises in a variety of contexts in the real world and involves numerous applications in science and engineering. Previous related work tackles limited cases with identical unit…
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
In recent years extensions of manifold Ricci curvature to discrete combinatorial objects such as graphs and hypergraphs (popularly called as "network shapes"), have found a plethora of applications in a wide spectrum of research areas…