A congruence for the Fourier coefficients of a modular form and its application to quadratic forms

Let F(z)=∑ _n=1^∞ A(n)q ⁿ denote the unique weight 6 normalized cuspidal eigenform on Γ₀(4). We prove that A(p)≡0,2,−1(mod 11) when p≠11 is a prime. We then use this congruence to give an application to the number of representations of an integer by quadratic form of level 4.      

Primitive roots in quadratic fields, II

We consider an analogue of Artin's primitive root conjecture for algebraic numbers which are not units in quadratic fields. Given such an algebraic number α, for a rational prime p which is inert in the field, the maximal possible order of α modulo (p) is p²−1. An extension of Artin's conjecture is that there are infinitely many such inert primes for which this order is maximal. We show that for any choice of 113 algebraic numbers satisfying a certain simple restriction, at least one of the algebraic numbers has order at least for infinitely many inert primes p.     

On the discrepancy of uniformly distributed roots of quadratic congruences

In this paper we consider the distribution of fractional parts {ν/p}, where p is a prime less than or equal to x and ν is the root in Z/pZ of a quadratic polynomial with negative discriminant. This set is known to be uniformly distributed as x→∞. Here we apply the Erd?s-Turán inequality to obtain an estimate for the discrepancy.     

Computing discrete logarithms in real quadratic congruence function fields of large genus

The discrete logarithm problem in various finite abelian groups is the basis for some well known public key cryptosystems. Recently, real quadratic congruence function fields were used to construct a public key distribution system. The security of this public key system is based on the difficulty of a discrete logarithm problem in these fields. In this paper, we present a probabilistic algorithm with subexponential running time that computes such discrete logarithms in real quadratic congruence function fields of sufficiently large genus. This algorithm is a generalization of similar algorithms for real quadratic number fields.

     

Geometrical solutions of some quadratic equations with non-real roots

This note gives geometrical/graphical methods of finding solutions of the quadratic equation ax ² + bx + c = 0, a p 0, with non-real roots. Three different cases which give rise to non-real roots of the quadratic equation have been discussed. In case I a geometrical construction and its proof for finding the solutions of the quadratic equation ax ² + bx + c = 0, a p 0, when a,b,c ] R, the set of real numbers, are presented. Case II deals with the geometrical solutions of the quadratic equation ax ² + bx + c = 0, a p 0, when b ] R, the set of real numbers; and a,c ] C, the set of complex numbers. Finally, the solutions of the quadratic equation ax ² + bx + c = 0, a p 0, when a,c ] R, the set of real numbers, and b ] C, the set of complex numbers, are presented in case III.     

Distribution of the roots of the zeta-function

Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 41, No. 2, pp. 243–251, February, 1989.     

On the congruence lattice of a Scott-domain

We prove that the congruence lattice of a Scott-domain can be characterized as a complete lattice.Presented by V. Trnkova.The research of the first author was supported by the NSERC of Canada.The research of the second author was supported by the Hungarian National Foundation for Scientific Research, under Grant No. 1903.     

Distribution of roots of quasianalytic functions

For functions of certain quasianalytic classes C{m_n} on (?∞, ∞) we determine a function ξ (x), depending on {m_n}, which is such that a sequence {x_k} is a sequence of the roots off(x) ε C{m_n} if and only if for somea $$\int_a^\infty {\tfrac{{dn(x)}}{{\xi (x - a}}< \infty ,} $$ where n(x) is a distribution function of the sequence {x_k}.     

Distribution of residues and primitive roots

Given an integer N?≥?3, we shall prove that for all primes p?≥?(N???2)²4 ^N , there exists x in (?/p?)^* such that x, x?+?1, ..., x?+?N???1 are all squares (respectively, non-squares) modulo p. Similarly, for an integer N?≥?2, we prove that for all primes $\displaystyle p \geq \exp(2^{5.54N})$ , there exists an element x?∈?(?/p?)^* such that x, x?+?1, ..., x?+?N???1 are all generators of (?/p?)^*.     

Convex hull of two quadratic or a conic quadratic and a quadratic inequality

Mathematical Programming - In this paper we consider an aggregation technique introduced by Yıldıran (J Math Control Inf 26:417–450, 2009) to study the convex hull of regions...     

Similarity and the structure of unital matrix quadratic trinomials with pairwise different characteristic roots

The normal form of certain polynomial matrices is found.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 175, pp. 63–68, 1989.     

Distribution of quadratic forms under skew normal settings

For a class of multivariate skew normal distributions, the noncentral skew chi-square distribution is studied. The necessary and sufficient conditions under which a sequence of quadratic forms is generalized noncentral skew chi-square distributed random variables are obtained. Several examples are given to illustrate the results.     

Distribution of Selmer groups of quadratic twists of a family of elliptic curves

We study the distribution of the size of the Selmer groups arising from a 2-isogeny and its dual 2-isogeny for quadratic twists of elliptic curves with full 2-torsion points in Q. We show that one of these Selmer groups is almost always bounded, while the 2-rank of the other follows a Gaussian distribution. This provides us with a small Tate-Shafarevich group and a large Tate-Shafarevich group. When combined with a result obtained by Yu [G. Yu, On the quadratic twists of a family of elliptic curves, Mathematika 52 (1-2) (2005) 139-154 (2006)], this shows that the mean value of the 2-rank of the large Tate-Shafarevich group for square-free positive integers n less than X is , as X→∞.     

On semigroups in which every Rees one-sided congruence is a congruence

The purpose of this paper is to examine the structure of those semigroups which satisfy one or both of the following conditions: A_r(A_ℓ): The Rees right (left) congruence associated with any right (left) ideal is a congruence. The conditions A_r and A_ℓ are generalizations of commutativity for semigroups. This paper is a continuation of the work of Oehmke [5] and Jordan [4] on H-semigroups (H for hamiltonian, a semigroup is called an H-semigroup if every one-sided congruence is a two-sided congruence). In fact the results of section 2 of Oehmke [5] are proved here under the condition A_r and/or A_ℓ and not the stronger hamiltonian condition. Section 1 of this paper is essentially a summary of the known results of Oehmke. In section 2 we examine the structure of irreducible semigroups satisfying the condition A_r and/or A_ℓ. In particular we determine all regular (torsion) irreducible semigroups satisfying both the conditions A_r and A_ℓ. This research has been supported by Grant A7877 of the National Research Council of Canada.     

On a congruence conjecture of Swisher

A congruence on a conjecture of van Hamme is established. This result confirms a particular case of a congruence conjecture of Swisher.     

An efficient algorithm for computing the roots of general quadratic,cubic and quartic equations

While the solution to deriving the roots of the general quadratic equation is adequately covered in a typical classroom environment, the same is not true for the general cubic and quartic equations. To the best of our knowledge, we do not see the roots of the general cubic or quartic equation discussed in any typical algebra textbook at the undergraduate level. In this paper, we propose an efficient algorithm in order to calculate the roots of the general quadratic, cubic and quartic equations. Examples are given to demonstrate the usefulness of this proposed algorithm.