Related papers: Quadratic points on intersections of two quadrics

Define an embedding of graph $G=(V,E)$ with $V$ a finite set of distinct points on the unit circle and $E$ the set of line segments connecting the points. Let $V_1,\ldots,V_k$ be a labeled partition of $V$ into equal parts. A 2-factor is…

Let $\mathcal{Q}_1$ and $\mathcal{Q}_2$ be two arbitrary quadrics with no common hyperplane in ${\mathbb{P}}^n(\mathbb{F}_q)$. We give the best upper bound for the number of points in the intersection of these two quadrics. Our result…

Given two irreducible conics $C$ and $D$ over a finite field $\mathbb{F}_q$ with $q$ odd, we show that there are $q^2/4+O(q^{3/2})$ points $P$ in $\mathbb{P}^2(\mathbb{F}_q)$ such that $P$ is external to $C$ and internal to $D$. This…

In this paper we provide some sufficient conditions for the existence of an odd or even cycle that passing a given vertex or an edge in $2$-connected or $2$-edge connected graphs. We provide some similar conditions for the existence of an…

A rational triangle is a triangle with sides of rational lengths. In this short note, we prove that there exists a unique pair of a rational right triangle and a rational isosceles triangle which have the same perimeter and the same area.…

This paper gives an algorithm to determine whether a number in a cyclic quartic field is a sum of two squares, mainly based on local-global principle of isotropy of quadratic forms.

We prove that two finite endomorphisms of the unit disk with degree at least two have orbits with infinite intersections if and only if they have a common iteration.

We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length connected through a vertex or a path, the arithmetical rank equals the projective dimension.

We answer an open question proposed by P\'{o}lik and Terlaky in 2007 that: {\it how we can decide whether two quadratic surfaces intersect without actually computing the intersections?}

We classify all totally real number fields of degree at most 5 that admit a universal quadratic form with rational integer coefficients; in fact, there are none over the previously unsolved cases of quartic and quintic fields. This fully…

Let $D$ be a strong digraph on $n=2m+1\geq 5$ vertices. In this paper we show that if $D$ contains a cycle of length $n-1$, then $D$ has also a cycle which contains all vertices with in-degree and out-degree at least $m$ (unless some…

In this paper, we find criteria for when cyclic cubic and cyclic quartic fields have well-rounded ideal lattices. We show that every cyclic cubic field has at least one well-rounded ideal. We also prove that there exist families of cyclic…

Dirac proved that any graph with minimum vertex degree $\delta$ contains either a cycle of length at least $2\delta$ or a Hamilton cycle. Motivated by this result, we characterize those graphs having no cycle longer than $2\delta$.

We prove that any smooth cubic surface defined over any number field satisfies the lower bound predicted by Manin's conjecture possibly after an extension of small degree.

This note is about an old conjecture of Voisin, which concerns zero--cycles on the self-product of surfaces of geometric genus one. We prove this conjecture for surfaces with $p_g=1$ and $q=2$.

Given a smooth projective variety $X$ over a field, consider the $\mathbb Q$-vector space $Z_0(X)$ of 0-cycles (i.e. formal finite $\mathbb Q$-linear combinations of the closed points of $X$) as a module over the algebra of finite…

We study properties of rational curves on complete intersections in positive characteristic. It has long been known that in characteristic 0, smooth Calabi-Yau and general type varieties are not uniruled. In positive characteristic,…

We give a complete characterization of polynomials in two complex variables that are cyclic with respect to the coordinate shifts acting on Dirichlet-type spaces in the bidisk, which include the Hardy space and the Dirichlet space of the…

We consider complete intersection ideals in a polynomial ring over a field of characteristic zero that are stable under the action of the symmetric group permuting the variables. We determine the possible representation types for these…

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…