Related papers: Effective obstruction to lifting Tate classes from…

We bound the length of the periodic part of the orbit of a preperiodic rational subvariety via good reduction information. This bound depends only on the degree of the map, the degree of the subvariety, the dimension of the projective…

We obtain some sharp estimates for the $p$-torsion of convex planar domains in terms of their area, perimeter, and inradius. The approach we adopt relies on the use of web functions (i.e. functions depending only on the distance from the…

In this paper, we study the deformations of curves in the projective 3-space $\mathbb P^3$ (space curves), one of the most classically studied objects in algebraic geometry. We prove a conjecture due to J. O. Kleppe (in fact, a version…

Motivated by an application to LDPC (low density parity check) algebraic geometry codes described by Voloch and Zarzar, we describe a computational procedure for establishing an upper bound on the arithmetic or geometric Picard number of a…

We find sharp upper bounds on the order of the automorphism group of a hypersurface in complex projective space in every dimension and degree. In each case, we prove that the hypersurface realizing the upper bound is unique up to…

Given a linear ordering of the vertices of a graph, the cutwidth of a vertex $v$ with respect to this ordering is the number of edges from any vertex before $v$ (including $v$) to any vertex after $v$ in this ordering. The cutwidth of an…

For each prime number $p$ and each integer $g \geqslant 5$, we construct infinitely many abelian varieties of dimension $g$ over $\overline{\mathbb{F}}_p$ satisfying the standard conjecture of Hodge type. The main tool is a recent theorem…

A common optimization problem is the minimization of a symmetric positive definite quadratic form $< x,Tx >$ under linear constrains. The solution to this problem may be given using the Moore-Penrose inverse matrix. In this work we extend…

Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded…

We study the motivic Pandharipande-Thomas invariants of the Enriques Calabi-Yau threefolds in fiber curve classes by basic computations and analysis of a wallcrossing formula of Toda. Motivated by our results we conjecture a formula for the…

We prove a \emph{query complexity} lower bound on rank-one principal component analysis (PCA). We consider an oracle model where, given a symmetric matrix $M \in \mathbb{R}^{d \times d}$, an algorithm is allowed to make $T$ \emph{exact}…

We present a method to compute the geometric Picard rank of a $K3$ surface over $\bbQ$. Contrary to a widely held belief, we show it is possible to verify Picard rank $1$ using reduction only at a single prime. Our method is based on…

Using an idelic argument and assuming the Gersten conjecture for Milnor K-theory, we show that the restriction map from one-cycles on a smooth projective scheme over a henselian local ring to a pro-system of thickened zero-cycles is…

We prove an effective upper bound on the number of effective sections of a hermitian line bundle over an arithmetic surface. It is an effective version of the arithmetic Hilbert--Samuel formula in the nef case. As a consequence, we obtain…

For a normal surface singularity, the discrepancy between the ordinary and dual middle-perversity intersection complexes over \(\mathbb Z\) is measured by a finite group \(E\). In previous work, \(E\) was identified with link torsion, the…

We introduce a new algorithm for computing the periods of a smooth complex projective hypersurface. The algorithm intertwine with a new method for computing an explicit basis of the singular homology of the hypersurface. It is based on…

Consider a two-class classification problem where the number of features is much larger than the sample size. The features are masked by Gaussian noise with mean zero and covariance matrix $\Sigma$, where the precision matrix…

In this paper, we provide tight lower bounds for the oracle complexity of minimizing high-order H\"older smooth and uniformly convex functions. Specifically, for a function whose $p^{th}$-order derivatives are H\"older continuous with…

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

We give a solution to the Poincar\'e Problem, in the formulation of Cerveau and Lins Neto. We obtain a bound on the degree of general leaves of foliations of general type, which is linear in $g$. To achieve this we study the birational…