Related papers: Patchworking real algebraic hypersurfaces with asy…
The main two families of real hypersurfaces in complex space forms are Hopf and ruled. However, very little is known about real hypersurfaces in the indefinite complex projective space $\cpn$. In a previous work, Kimura and the second…
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. A numbering $\nu$ is reducible to a numbering $\mu$ if there is an effective procedure which given a $\nu$-index of an object from…
The 121 real schemes, i.e., ambient isotopy classes, of smooth real plane algebraic curves of degree seven were classified by Viro (1984). By constructing one patchwork of the dilated triangle $7\cdot\Delta_2$ for each real scheme, we…
A new formula is obtained in algebraic topology, in terms of Betti numbers, and a new method, called the spinal method, is suggested and developed for generating quadrangulations of closed orientable surfaces. Those surfaces arise as the…
For a graph $G$ on $[n]$, the $k$-cut complex $\Delta_k(G)$ has facets $[n]\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\'c Milutinovi\'c, Sundaram, and Xue proved that the…
These are notes of the mini-course I gave during the CIMPA summer school at Villa de Leyva, Colombia, in July $2014$. The subject was my joint work with Damien Gayet on the topology of random real hypersurfaces, restricting myself to the…
For a hypersurface defined by a complex analytic function, we obtain a chain complex of free abelian groups, with ranks given in terms of relative polar multiplicities, which has cohomology isomorphic to the reduced cohomology of the real…
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been…
In this work, we present a non-parametric texture synthesis algorithm capable of producing plausible images without copying large tiles of the exemplar. We focus on a simple synthesis algorithm, where we explore two patch match heuristics;…
We describe a parallel polynomial time algorithm for computing the topological Betti numbers of a smooth complex projective variety $X$. It is the first single exponential time algorithm for computing the Betti numbers of a significant…
We study the hyperk\"ahler analogues of moduli spaces of semistable n-gons in complex projective space. We prove that the hyperk\"ahler Kirwan map is surjective and produce a formula that recursively calculates the Betti numbers of these…
We develop a new method of constructing non-arithmetic lattices in the projective orthogonal group $\text{PO}(n,1)$ for every integer $n$ larger than one. The technique is to consider anti-holomorphic involutions on a complex arithmetic…
An exact computation of the persistent Betti numbers of a submanifold $X$ of a Euclidean space is possible only in a theoretical setting. In practical situations, only a finite sample of $X$ is available. We show that, under suitable…
We stratify families of projective and very affine hypersurfaces according to their topological Euler characteristic. Our new algorithms compute all strata using algebro-geometric techniques. For very affine hypersurfaces, we investigate…
We give a constructive proof using tropical modifications of the existence of a family of real algebraic plane curves with asymptotically maximal numbers of even ovals.
We study the persistent homology of random \v{C}ech complexes. Generalizing a method of Penrose for studying random geometric graphs, we first describe an appropriate theoretical framework in which we can state and address our main…
A complete method is proposed to compute a certified, or ambient isotopic, meshing for an implicit algebraic surface with singularities. By certified, we mean a meshing with correct topology and any given geometric precision. We propose a…
Fatgraphs are multigraphs enriched with a cyclic order of the edges incident to a vertex. This paper presents algorithms to: (1) generate the set of all fatgraphs having a given genus and number of boundary cycles; (2) compute automorphisms…
Based on high precision computation of periods and lattice reduction techniques, we compute the Picard group of smooth surfaces. We also study the lattice reduction technique that is employed in order to quantify the possibility of…
This paper undertakes the study of the topology of T-manifolds of arbitrary codimension obtained by combinatorial patchworking with real phase structure as described by Brugall\'e, L\'opez de Medrano and Rau (2024). We prove new bounds on…