Related papers: Sum of two squares in cyclic quartic fields
A bivariate quartic form is a homogeneous bivariate polynomial of degree four. A criterion of positivity for such a form is known. In the present paper this criterion is reformulated in terms of pseudotensorial invariants of the form.
A Hamiltonian cycle of a graph is a closed path that visits each site once and only once. I study a field theoretic representation for the number of Hamiltonian cycles for arbitrary graphs. By integrating out quadratic fluctuations around…
We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…
The clustering coefficient is a valuable tool for understanding the structure of complex networks. It is widely used to analyze social networks, biological networks, and other complex systems. While there is generally a single common…
We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.
Given two closed curves in a surface, we propose an algorithm to detect whether they are of the same type or not.
This work is an attempt to classify and quantify instances when a weighted sum of two squares of positive integers, $3n_{1}^2+n_{2}^2$, can be realized in more than one way. Our project was inspired by a particular study of two-dimensional…
The square $C^{*2}$ of a linear error correcting code $C$ is the linear code spanned by the component-wise products of every pair of (non-necessarily distinct) words in $C$. Squares of codes have gained attention for several applications…
The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…
A short and elementary proof, and a finite-form generalization, are given of Jacobi's formula for the number of ways of writing an integer as a sum of four squares (that implies Lagrange's famous 1777 theorem.)
In this paper, we prove two theorems concerning the sums of squared distances between points on a unit $n$-sphere that generalize two facts previously known about the case where the points are the vertices of a regular polygon. The first…
We give an asymptotic formula for the mean value of the number of representations of an integer as sum of two squares known as the Gauss circle problem.
The determination of weight distribution of cyclic codes involves evaluation of Gauss sums and exponential sums. Despite of some cases where a neat expression is available, the computation is generally rather complicated. In this note, we…
We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from…
Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…
In this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials.
The two squares theorem of Fermat is a gem in number theory, with a spectacular one-sentence "proof from the Book". Here is a formalisation of this proof, with an interpretation using windmill patterns. The theory behind involves…
We prove a Universal Coefficient Theorem for objects in the bootstrap class in the equivariant Kasparov category for a finite cyclic group of square-free order.
The characteristic numbers of smooth plane quartics are computed using intersection theory on a component of the moduli space of stable maps. This completes the verification of Zeuthen's prediction of characteristic numbers of smooth plane…
Let F_q be the finite field of q elements. Let H be a multiplicative subgroup of F_q^*. For a positive integer k and element b\in F_q, we give a sharp estimate for the number of k-element subsets of H which sum to b.