English
Related papers

Related papers: (2^n,2^n,2^n,1)-relative difference sets and their…

200 papers

Series of finite dimensional representations of the superalgebras spl(p,q) can be formulated in terms of linear differential operators acting on a suitable space of polynomials. We sketch the general ingredients necessary to construct these…

q-alg · Mathematics 2007-05-23 Yves Brihaye , Stefan Giller , Piotr Kosinski

Let $\mathcal{F}$ be a set of $n$ real analytic functions with linearly independent derivatives restricted to a compact interval $I$. We show that for any finite set $A \subset I$, there is a function $f \in \mathcal{F}$ that satisfies…

Combinatorics · Mathematics 2025-03-10 Samuel Mansfield

Let $P_{2k}$ be a homogeneous polynomial of degree $2k$ and assume that there exist $C>0$, $D>0$ and $\alpha \ge 0$ such that \begin{equation*} \left\langle P_{2k}f_{m},f_{m}\right\rangle_{L^2(\mathbb{S}^{d-1})}\geq \frac{1}{C\left(…

Complex Variables · Mathematics 2022-09-08 H. Render , J. M. Aldaz

Let F(x_1,...,x_m) = u_1 x_1 + ... + u_m x_m be a linear form with nonzero, relatively prime integer coefficients u_1,..., u_m. For any set A of integers, let F(A) = {F(a_1,...,a_m) : a_i in A for i=1,...,m}. The representation function…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson

We study trivariate permutation polynomials over $\mathbb{F}_{2^{m}}$ extending two APN permutation families of Li--Kaleyski (IEEE Trans. Inform. Theory, 2024) by allowing the scalar parameter to vary over $\mathbb{F}_{2^m}^*$. For \[…

Number Theory · Mathematics 2026-03-17 Daniele Bartoli , Pantelimon Stanica

A classification theorem for linear differential equations in two variables (one real and one Grassmann) having polynomial solutions(the generalized Bochner problem) is given. The main result is based on the consideration of the eigenvalue…

High Energy Physics - Theory · Physics 2008-02-03 Alexander Turbiner

We study approximation of Boolean functions by low-degree polynomials over the ring $\mathbb{Z}/2^k\mathbb{Z}$. More precisely, given a Boolean function $F:\{0,1\}^n \rightarrow \{0,1\}$, define its $k$-lift to be $F_k:\{0,1\}^n \rightarrow…

Computational Complexity · Computer Science 2020-05-08 Abhishek Bhrushundi , Prahladh Harsha , Srikanth Srinivasan

In this paper, we study polynomials of the form $f(x)=(x^n+x^{n-1}+...+1)^l$ for $l=1,2,3,4$ to generate a pattern titled "unique coefficient pattern". Namely, we analyze each unique coefficient patterns of $f(x)$ and generate functions…

Combinatorics · Mathematics 2015-05-19 Alperen Sirin

We prove that functions $f:\f{2^m} \to \f{2^m}$ of the form $f(x)=x^{-1}+g(x)$ where $g$ is any non-affine polynomial are APN on at most a finite number of fields $\f{2^m}$. Furthermore we prove that when the degree of $g$ is less then 7…

Algebraic Geometry · Mathematics 2009-01-28 Gregor Leander , François Rodier

An $n$-independent set in two dimensions is a set of nodes admitting (not necessarily unique) bivariate interpolation with polynomials of total degree at most $n.$ For an arbitrary $n$-independent node set $\mathcal X$ we are interested…

Numerical Analysis · Mathematics 2015-05-05 Vahagn Vardanyan

A new class of 2-orthogonal polynomials satisfying orthogonality conditions with respect to a pair of linear functionals $(u_0,u_1)$ was presented in Douak K & Maroni P [On a new class of 2-orthogonal polynomials, I: the recurrence…

Classical Analysis and ODEs · Mathematics 2023-03-09 Khalfa Douak , Pascal Maroni

We investigate pairs of permutations $F,G$ of $\mathbb{F}_{p^n}$ such that $F(x+a)-G(x)$ is a permutation for every $a\in\mathbb{F}_{p^n}$. We show that necessarily $G(x) = \wp(F(x))$ for some complete mapping $-\wp$ of $\mathbb{F}_{p^n}$,…

Information Theory · Computer Science 2022-12-27 Nurdagul Anbar , Tekgul Kalyci , Wilfried Meidl , Constanza Riera , Pantelimon Stanica

Let W be a polyconvex function defined on the 2 x 2 real matrices. The Busemann representative f, say, of W is the largest possible convex representative of W. Writing L for the set of affine functions on R^{5} such that a(A, det A) is less…

Functional Analysis · Mathematics 2008-09-24 J. J Bevan

We study the problem of characterizing polynomial vector fields that commute with a given polynomial vector field on a plane. It is a classical result that one can write down solution formulas for an ODE that corresponds to a planar vector…

Dynamical Systems · Mathematics 2020-11-17 Joel Nagloo , Alexey Ovchinnikov , Peter Thompson

Let $F(X)=X^{2^{2k}+2^k+1}$ be the power function over the finite field $\GF{2^{4k}}$ which is known as the Bracken-Leander function. In \cite{BCC10,BL10,CV20,Fu22,XY17}, it was proved that the number of solutions in $\GF{q^4}$ to the…

Information Theory · Computer Science 2023-05-23 Kwang Ho Kim , Sihem Mesnager , Chung Hyok Kim

We generalize both the notion of polynomial functions on Lie groups and the notion of horizontally affine maps on Carnot groups. We fix a subset $S$ of the algebra $\mathfrak g$ of left-invariant vector fields on a Lie group $\mathbb G$ and…

Group Theory · Mathematics 2020-11-30 Gioacchino Antonelli , Enrico Le Donne

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = A+A = \{a + b \ | \ a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. We prove that the number of sumsets in $\mathbb{F}_2^n$ is asymptotically…

Combinatorics · Mathematics 2024-04-17 Noga Alon , Or Zamir

Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…

Algebraic Geometry · Mathematics 2013-04-23 Alicia Dickenstein , Ioannis Emiris , Anna Karasoulou

Two subsets $S$ and $T$ of $\mathbb{F}_2^n$ are \textit{affinely equivalent} if there is an affine automorphism of $\mathbb{F}_2^n$ taking $S$ to $T$. Given a basis of the affine span of $S$, we can construct a Venn diagram whose regions…

Combinatorics · Mathematics 2025-09-03 Kariane Calta , Sarah Covey , Timothy E. Goldberg , Lauren L. Rose , Daniel Rose-Levine

Planar functions over finite fields give rise to finite projective planes. They were also used in the constructions of DES-like iterated ciphers, error-correcting codes, and codebooks. They were originally defined only in finite fields with…

Information Theory · Computer Science 2016-09-06 Longjiang Qu