相关论文: Patchworking real algebraic varieties

This survey highlights the recent advances in algorithms for numerical linear algebra that have come from the technique of linear sketching, whereby given a matrix, one first compresses it to a much smaller matrix by multiplying it by a…

The universal centralizer of a semisimple algebraic group is the family of centralizers of regular elements, parametrized by their conjugacy classes. When the group is of adjoint type, we construct a smooth, log-symplectic fiberwise…

In the first part of the paper, we prove a mirror symmetry isomorphism between integral tropical homology groups of a pair of mirror tropical Calabi-Yau hypersurfaces. We then apply this isomorphism to prove that a primitive patchworking of…

In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…

A pseudocircle is a simple closed curve on some surface; an arrangement of pseudocircles is a collection of pseudocircles that pairwise intersect in exactly two points, at which they cross. Ortner proved that an arrangement of pseudocircles…

Image matting is generally modeled as a space transform from the color space to the alpha space. By estimating the alpha factor of the model, the foreground of an image can be extracted. However, there is some dimensional information…

This is a survey article written for the Jahresberichte der DMV. Tropical geometry can be viewed as an efficient combinatorial tool to study degenerations in algebraic geometry. Abstract tropical curves are essentially metric graphs, and…

A graph profile records all possible densities of a fixed finite set of graphs. Profiles can be extremely complicated; for instance the full profile of any triple of connected graphs is not known, and little is known about hypergraph…

The algebraic translational surface is a typical modeling surface in computer aided design and architecture industry. In this paper, we give a necessary and sufficient condition for that algebraic surface having a standard parametric…

Two-dimensional affine A-nets in 3-space are quadrilateral meshes that discretize surfaces parametrized along asymptotic lines. The characterizing property of A-nets is planarity of vertex stars, so for generic A-nets the elementary…

Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…

Hive plots are a graph visualization style placing vertices on a set of radial axes emanating from a common center and drawing edges as smooth curves connecting their respective endpoints. In previous work on hive plots, assignment to an…

Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…

We study intersection theory for differential algebraic varieties. Particularly, we study families of differential hypersurface sections of arbitrary affine differential algebraic varieties over a differential field. We prove the…

The Reeb graph of a smooth function is a graph being a natural quotient space of the manifold of the domain and the space of all connected components of preimages. Such a combinatorial and topological object roughly and compactly represents…

A regularized version of Mixture Models is proposed to learn a principal graph from a distribution of $D$-dimensional data points. In the particular case of manifold learning for ridge detection, we assume that the underlying manifold can…

Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…

As a starting point for higher-dimensional patching in the Berkovich setting, we show that this technique is applicable around certain fibers of a relative Berkovich analytic curve. As a consequence, we prove a local-global principle over…

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…