Related papers: Periods of Complete Intersection Algebraic Cycles
Let $k$ be the function field of a complex curve or the field $C((t))$. We show that for a smooth complete intersection $X$ of $r$ hypersurfaces in $P^n_k$ of respective degrees $d_1,...,d_r$ with $\sum d_i^2\leq n+1$ the R-equivalence on…
In this paper the author provides a generalization of classical linkage, i.e. linkage by a complete intersection, in a different context. Namely she looks at residuals in the scheme theoretic intersection of a rational normal surface or…
One of the themes in algebraic geometry is the study of the relation between the ``topology'' of a smooth projective variety and a (``general'') hyperplane section. Recent results of Nori produce cohomological evidence for a conjecture that…
We determine the product structure on Hochschild cohomology of commutative algebras in low degrees, obtaining the answer in all degrees for complete intersection algebras. As applications, we consider cyclic extension algebras as well as…
For $0\leq \ell <k$, a Hamiltonian $\ell$-cycle in a $k$-uniform hypergraph $H$ is a cyclic ordering of the vertices of $H$ in which the edges are segments of length $k$ and every two consecutive edges overlap in exactly $\ell$ vertices. We…
Following Newton, Ivory and Arnold, we study the Newtonian potentials of algebraic hypersurfaces in $R^n$. The ramification of (analytic continuations of) these potential depends on a monodromy group, which can be considered as a proper…
On \'etudie les cycles alg\'ebriques de codimension 3 sur les hypersurfaces cubiques lisses de dimension 5. Pour une telle hypersurface, on d\'emontre d'une part que son groupe de Griffiths des cycles de codimension 3 est trivial et d'autre…
A cycle of length $t$ in a hypergraph is an alternating sequence $v_1,e_1,v_2\dots,v_t,e_t$ of distinct vertices $v_i$ and distinct edges $e_i$ so that $\{v_i,v_{i+1}\}\subseteq e_i$ (with $v_{t+1}:=v_1$). Let $\lambda K_n^h$ be the…
In this paper we study duality for evaluation codes on intersections of d hypersurfaces with given d-dimensional Newton polytopes, so called toric complete intersection codes. In particular, we give a condition for such a code to be…
We study the design of robust subexponential algorithms for classical connectivity problems on intersection graphs of similarly sized fat objects in $\mathbb{R}^d$. In this setting, each vertex corresponds to a geometric object, and two…
We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of…
We compute the essential dimension of the functors Forms_{n,d} and Hypersurf_{n, d} of equivalence classes of homogeneous polynomials in n variables and hypersurfaces in P^{n-1}, respectively, over any base field k of characteristic 0. Here…
The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…
A heterodimensional cycle consists of a pair of heteroclinic connections between two saddle periodic orbits with unstable manifolds of different dimensions. Recent theoretical work on chaotic dynamics beyond the uniformly hyperbolic setting…
Let $\mathcal{G}(n,r,s)$ denote a uniformly random $r$-regular $s$-uniform hypergraph on $n$ vertices, where $s$ is a fixed constant and $r=r(n)$ may grow with $n$. An $\ell$-overlapping Hamilton cycle is a Hamilton cycle in which…
For positive integers $r > \ell$, an $r$-uniform hypergraph is called an $\ell$-cycle if there exists a cyclic ordering of its vertices such that each of its edges consists of $r$ consecutive vertices, and such that every pair of…
The main purpose of this paper is to show that the mixed Hodge polynomial of the ``space of equations'' for smooth complete intersections of given multidegree in $\mathbb{C} P^n$ is divisible by the mixed Hodge polynomial of the group…
Given a set $R$, a hypergraph is $R$-uniform if the size of every hyperedge belongs to $R$. A hypergraph $\mathcal{H}$ is called \textit{covering} if every vertex pair is contained in some hyperedge in $\mathcal{H}$. In this note, we show…
We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a…
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…