Related papers: A Few More Quadratic APN Functions
Let $ped(n)$ denote the number of partitions of $n$ wherein even parts are distinct (and odd parts are unrestricted). We show infinite families of congruences for $ped(n)$ modulo $8$. We also examine the behavior of $ped_{-2}(n)$ modulo $8$…
We introduce a zeta function counting imaginary quadratic number fields by their class numbers. It is proved that such a function is rational depending only on the eight roots of unity of degrees $1$ and $2$. As a corollary, one gets a…
Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow…
We introduce and study a new class of integral domains which we call irreducible divisor pair domains (IDPDs). In particular, we show how IDPDs fit in with other classes of integral domains defined in terms of factorization conditions. For…
We show how to construct infinite families of explicitly determined cubic number fields whose class group has a subgroup isomorphic to $(\mathbb{Z}/2)^8$ using degree $1$ del Pezzo surfaces. We illustrate the method and provide an example…
A doubly infinite set of series expansion for $1/\pi$ are reported. They follow trivially from a formal expansion for the quotient of the values taken by the gamma function for two (complex) arguments differing by an integer plus one half,…
This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…
The classification, up to a center-affinity, of the homogeneous quadratic differential systems defined on $\mathbb{R}^{3}$ that have at least a semisimple nonsingular derivation, is achieved. It is proved that there exist four…
Given a rational function of degree at least two defined over a number field k, we study the cardinality of the set of rational iterated preimages. We prove bounds for the cardinality of this set as the rational function varies in certain…
A non-nilpotent variety of algebras is almost nilpotent if any proper subvariety is nilpotent. Let the base field be of characteristic zero. It has been shown that for associative or Lie algebras only one such variety exists. Here we…
We study quadratic approximations for two families of hyperquadratic continued fractions in the field of Laurent series over a finite field. As the first application, we give the answer to a question of the second author concerning…
We construct parameterized families of imaginary (resp. real) quadratic fields whose class groups have $n$-rank at least $2$.
In this note we construct an unlimited family of irregular algebraic surfaces of general type with canonical map of degree $ 8 $, irregularity $ 1 $ and arbitrarily large geometric genus such that the image of the canonical map is not a…
Two rational functions $f,g\in\Bbb F_q(X)$ are said to be {\em equivalent} if there exist $\phi,\psi\in\Bbb F_q(X)$ of degree one such that $g=\phi\circ f\circ\psi$. We give an explicit formula for the number of equivalence classes of…
We discuss continued fractions on real quadratic number fields of class number 1. If the field has the property of being 2-stage euclidean, a generalization of the euclidean algorithm can be used to compute these continued fractions.…
We determine the most general group of equivalence transformations for a family of differential equations defined by an arbitrary vector field on a manifold. We also find all invariants and differential invariants for this group up to the…
In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…
The purpose of this paper is to present the extended definitions and characterizations of the classical notions of APN and maximum nonlinear Boolean functions to deal with the case of mappings from a finite group K to another one N with the…
We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…
Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…