Related papers: On reconstructing subvarieties from their periods

We study the birational geometry of hypersurfaces in projective varieties of the form $\mathbf{P}^1\times Z$, where $Z$ satisfies mild assumptions. Building on recent results of Herrera--Laface--Ugaglia, we study their Cox rings (when…

We give an optimal-size representation for the elements of the trace zero subgroup of the Picard group of an elliptic or hyperelliptic curve of any genus, with respect to a field extension of any prime degree. The representation is via the…

We investigate the surjectivity of the real cycle class map from $I$-cohomology to classical intergral cohomology for some real smooth varieties, in particular surfaces. This might be considered as one of several possible incarnations of…

We approach the Torelli problem of recostructing a curve from its Jacobian from a computational point of view. Following Dubrovin, we design a machinery to solve this problem effectively, which builds on methods in numerical algebraic…

In this thesis we give a construction of cyclic cocycles on convolution algebras twisted by gerbes over discrete translation groupoids. In his seminal book, Connes constructs a map from the equivariant cohomology of a manifold carrying the…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

We generalize the Harnack-Thom theorem to relate the ranks of the Lawson homology groups with $\Z_2$-coefficients of a real quasiprojective variety with the ranks of its reduced real Lawson homology groups. In the case of zero-cycle group,…

We show that the cycle map on a variety X, from algebraic cycles modulo algebraic equivalence to integer cohomology, lifts canonically to a topologically defined quotient of the complex cobordism ring of X. This more refined cycle map gives…

We describe a method to construct indecomposable classes in Bloch's higher Chow group $CH^2(X,1)$ on algebraic surfaces over the complex numbers via transcendental methods and apply it to obtain examples on K3-surfaces and some surfaces of…

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…

This paper is about the question whether a cycle in the l-adic cohomology of a smooth projective variety over the rational numbers, which is algebraic over almost all finite fields, is also algebraic over the rationals. We use ultraproducts…

It is well-known that Shor's factorization algorithm, Simon's period-finding algorithm, and Deutsch's original XOR algorithm can all be formulated as solutions to a hidden subgroup problem. Here the salient features of the…

A new method for solving systems of linear algebraic equations of a special type arising in solving problems of image reconstruction has been proposed. This method, due to a certain symmetry of the matrix and the choice of the voxel…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

A method to upsample insufficiently sampled experimental time series of pseudo-periodic signals is proposed. The result is an estimate of the pseudo-periodic cycle underlying the signal. This hypersampling requires a sufficiently sampled…

We prove analogues of several well-known results concerning rational morphisms between quadrics for the class of so-called quasilinear $p$-hypersurfaces. These hypersurfaces are nowhere smooth over the base field, so many of the geometric…

We prove the conjectures of Hodge and Tate for any four-dimensional hyper-K\"ahler variety of generalized Kummer type. For an arbitrary variety $X$ of generalized Kummer type, we show that all Hodge classes in the subalgebra of the rational…

Subgraph isomorphism counting is known as #P-complete and requires exponential time to find the accurate solution. Utilizing representation learning has been shown as a promising direction to represent substructures and approximate the…

Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in a purely topological persistence diagram (also termed as barcode). In our earlier work, we showed that computing…

When we try to solve a system of linear equations, we can consider a simple iterative algorithm in which an equation including only one variable is chosen at each step, and the variable is fixed to the value satisfying the equation. The…