English
Related papers

Related papers: A Few More Quadratic APN Functions

200 papers

The goal is to make a global study of the family QsnSN of all real quadratic polynomial differential systems which have a finite semi-elemental saddle-node and an infinite saddle-node formed by the collision of two infinite singular points.…

Dynamical Systems · Mathematics 2023-11-20 Joan C. Artés , Alex C. Rezende , Regilene D. S. Oliveira

Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…

Information Theory · Computer Science 2022-10-20 Haode Yan , Sihem Mesnager , Xiantong Tan

It is proved that the number of 9-regular partitions of n is divisible by 3 when n is congruent to 3 mod 4, and by 6 when n is congruent to 13 mod 16. An infinite family of congruences mod 3 holds in other progressions modulo powers of 4…

Combinatorics · Mathematics 2013-06-07 William J. Keith

Constructing permutation polynomials over finite fields, particularly those with simple algebraic structure in multiple variables, is a fundamental problem with applications in cryptography and coding theory. Recently, Li and Kaleyski (IEEE…

Number Theory · Mathematics 2026-02-24 Daniele Bartoli , Mohit Pal , Pantelimon Stanica , Tommaso Toccotelli

Let $a_3(n)$ and $a_9(n)$ are 3 and 9-regular cubic partitions of $n$. In this paper, we find the infinite family of congruences modulo powers of 3 for $a_3(n)$ and $a_9(n)$ such as \[a_3\left (3^{2\alpha}n+\frac{3^{2\alpha}-1}{4}\right…

Number Theory · Mathematics 2019-07-02 D. S. Gireesh , M. S. Mahadeva Naika , Shivashankar C

Let $F$ be a finite field, let $f$ be a function from $F$ to $F$, and let $a$ be a nonzero element of $F$. The discrete derivative of $f$ in direction $a$ is $\Delta_a f \colon F \to F$ with $(\Delta_a f)(x)=f(x+a)-f(x)$. The differential…

Information Theory · Computer Science 2026-01-01 Daniel J. Katz , Kathleen R. O'Connor , Kyle Pacheco , Yakov Sapozhnikov

We construct a class of multiple Legendre polynomials and prove that they satisfy an Ap\'ery-like recurrence. We give new upper bounds of the approximation measures of logarithms of rational numbers by algebraic numbers of bounded degree.…

Number Theory · Mathematics 2025-12-16 Raffaele Marcovecchio

This paper discusses examples of integral factorial ratios of height 2 or more. It classifies (apart from finitely many examples) such factorial ratios with height 2 and norm at most 1/3, and describes a general result which exhibits more…

Number Theory · Mathematics 2020-07-01 K. Soundararajan

For each odd prime power q, we construct an infinite sequence of rational functions f(X) in F_q(X), each of which is exceptional, which means that for infinitely many n the map c-->f(c) induces a bijection of P^1(F_{q^n}). Moreover, each of…

Number Theory · Mathematics 2022-06-08 Zhiguo Ding , Michael E. Zieve

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

Number Theory · Mathematics 2019-02-12 Gareth Boxall , Gareth Jones , Harry Schmidt

Two new expansions for partial sums of Gauss' triangular and square numbers series are given. As a consequence, we derive a family of inequalities for the overpartition function $\bar{p}(n)$ and for the partition function $p_1(n)$ counting…

Combinatorics · Mathematics 2013-01-15 Victor J. W. Guo , Jiang Zeng

We prove that there exists, up to isomorphism, exactly one function field over the finite field of two elements of class number one and genus four. This result, together with the ones of MacRae, Madan, Leitzel, Queen and Stirpe, establishes…

Number Theory · Mathematics 2014-12-17 Martha Rzedowski-Calderón , Gabriel Villa-Salvador

The article is devoted to approximate, global and along curves differentiability of functions over non-archimedean infinite fields with non-trivial valuations. Fields with zero and non-zero characteristics are considered. Spaces of…

Classical Analysis and ODEs · Mathematics 2010-03-16 S. V. Ludkovsky

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…

Group Theory · Mathematics 2009-02-10 R. I. Grigorchuk , S. V. Ivanov

The authors' previous results on the arity gap of functions of several variables are refined by considering polynomial functions over arbitrary fields. We explicitly describe the polynomial functions with arity gap at least 3, as well as…

Rings and Algebras · Mathematics 2013-06-05 Miguel Couceiro , Erkko Lehtonen , Tamás Waldhauser

We extend a technique, originally due to the first author and Poonen, for proving cases of the Strong Uniform Boundedness Principle (SUBP) in algebraic dynamics over function fields of positive characteristic. The original method applied to…

Number Theory · Mathematics 2022-12-20 John R. Doyle , Xander Faber

APN functions play a big role as primitives in symmetric cryptography as building blocks that yield optimal resistance to differential attacks. In this note, we consider a recent extension of a biprojective APN family by G\"olo\u{g}lu…

Combinatorics · Mathematics 2024-02-23 Lukas Kölsch

In the independent works by Kalgin and Idrisova and by Beierle, Leander and Perrin, it was observed that the Gold APN functions over $\mathbb{F}_{2^5}$ give rise to a quadratic APN function in dimension 6 having maximum possible linearity…

Information Theory · Computer Science 2023-02-28 Christof Beierle , Claude Carlet

Six non-affine 3-parameter families of complex Hadamard matrices of order 8 are presented. These families contain Hadamard matrices that are not equivalent to any previously known Hadamard matrices in the literature. Each family arises from…

Combinatorics · Mathematics 2025-06-25 Tuomo Valtonen

The complexity of continuous piecewise affine (CPA) functions can be measured by the number of pieces $p$ or the number of distinct affine functions $n$. For CPA functions on $\mathbb{R}^d$, this paper shows an upper bound of $p=O(n^{d+1})$…

Combinatorics · Mathematics 2025-03-17 Leo Zanotti