English
Related papers

Related papers: On CCZ-equivalence of the inverse function

200 papers

We consider the class of all analytic and locally univalent functions $f$ of the form $f(z)=z+\sum_{n=2}^\infty a_{2n-1} z^{2n-1}$, $|z|<1$, satisfying the condition $$ {\rm Re}\,\left(1+\frac{zf^{\prime\prime}(z)}{f^\prime…

Complex Variables · Mathematics 2016-04-20 Sarita Agrawal , Swadesh Kumar Sahoo

The inverse problem for representation functions takes as input a triple (X,f,L), where X is a countable semigroup, f : X --> N_0 \cup {\infty} a function, L : a_1 x_1 + ... + a_h x_h an X-linear form and asks for a subset A \subseteq X…

Number Theory · Mathematics 2007-12-31 Peter Hegarty

Let $U\subseteq\mathbb{R}^{n}$ be open and convex. We show that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we…

Functional Analysis · Mathematics 2012-01-17 D. Azagra

By transforming the Zeta function into a real function through Laplace inverse transformation, an algebraic research paradigm for prime number distribution was established, and important results were obtained (page 10). This method has…

General Mathematics · Mathematics 2025-08-01 Jing Min Zhu

We consider the problem of testing if a given function f : F_2^n -> F_2 is close to any degree d polynomial in n variables, also known as the Reed-Muller testing problem. The Gowers norm is based on a natural 2^{d+1}-query test for this…

Combinatorics · Mathematics 2010-04-12 Arnab Bhattacharyya , Swastik Kopparty , Grant Schoenebeck , Madhu Sudan , David Zuckerman

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

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

We investigate the action of Alesker's Lefschetz operators on translation invariant valuations on convex bodies. For scalar valued valuations, we describe this action on the level of Klain-Schneider functions by a Radon type transform,…

Metric Geometry · Mathematics 2024-02-23 Leo Brauner , Georg C. Hofstätter , Oscar Ortega-Moreno

Let $\mathcal{S}$ denote the class of analytic and univalent ({\it i.e.}, one-to-one) functions $f(z)= z+\sum_{n=2}^{\infty}a_n z^n$ in the unit disk $\mathbb{D}=\{z\in \mathbb{C}:|z|<1\}$. For $f\in \mathcal{S}$, Ma proposed the…

Complex Variables · Mathematics 2022-09-26 Vasudevarao Allu , Abhishek Pandey

We consider the Mellin transforms of certain Legendre functions based upon the ordinary and associated Legendre polynomials. We show that the transforms have polynomial factors whose zeros lie all on the critical line Re $s=1/2$. The…

Mathematical Physics · Physics 2013-09-02 Mark W. Coffey , Matthew C. Lettington

Let $u\not\equiv -\infty$ be a subharmonic function on the complex plane $\mathbb C$. Then for any function $r\colon\mathbb C\to (0,1]$ satisfying the condition $$\inf_{z\in\mathbb C}\frac{\ln r(z)}{\ln(2+|z|)}>-\infty,$$ there is an entire…

Complex Variables · Mathematics 2022-03-24 B. N. Khabibullin

A function $f:\mathbb{Z}_n \to \mathbb{C}$ can be represented as a linear combination $f(x)=\sum_{\alpha \in \mathbb{Z}_n}\widehat{f}(\alpha) \chi_{\alpha,n}(x)$ where $\widehat{f}$ is the (discrete) Fourier transform of $f$. Clearly, the…

Classical Analysis and ODEs · Mathematics 2016-10-27 Joel Laity , Barak Shani

Bent-negabent functions have many important properties for their application in cryptography since they have the flat absolute spectrum under the both Walsh-Hadamard transform and nega-Hadamard transform. In this paper, we present four new…

Information Theory · Computer Science 2022-09-20 Fei Guo , Zilong Wang , Guang Gong

For almost all tuples $(x_1,\dots,x_n)$ of complex numbers, a strong version of Schanuel's Conjecture is true: the $2n$ numbers $x_1,\dots,x_n, {\mathrm e}^{x_1},\dots, {\mathrm e}^{x_n}$ are algebraically independent. Similar statements…

Number Theory · Mathematics 2025-04-22 Michel Waldschmidt

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

We provide conditions under which the set of Rijndael functions considered as permutations of the state space and based on operations of the finite field $\GF (p^k)$ ($p\geq 2$ a prime number) is not closed under functional composition.…

Group Theory · Mathematics 2012-12-20 L. Babinkostova , K. W. Bombardier , M. M. Cole , T. A. Morrell , C. B. Scott

Given a subset $S=\{s_0, s_1\}$ of the complex plane with two points and an infinite subset ${\mathscr S}$ of $S\times {\mathbb N}$, where ${\mathbb N}=\{0,1,2,\dots\}$ is the set of nonnegative integers, we ask for a lower bound for the…

Number Theory · Mathematics 2019-12-03 Michel Waldschmidt

We study Chern-Simons Gauge Theory in axial gauge on ${\mathbb R}^3.$ This theory has a quadratic Lagrangian and therefore expectations can be computed nonperturbatively by explicit formulas, giving an (unbounded) linear functional on a…

Differential Geometry · Mathematics 2024-05-28 Jonathan Weitsman

In this paper we first show that for $n$ being even the images of the Fueter mapping, as monogenic functions, like for the odd $n$ cases proved through computation on the pointwise differential operator, are also of the axial type (the…

Complex Variables · Mathematics 2018-05-09 Baohua Dong , Tao Qian

In a recent work, Beierle, Brinkmann and Leander presented a recursive tree search for finding APN permutations with linear self-equivalences in small dimensions. In this paper, we describe how this search can be adapted to find many new…

Information Theory · Computer Science 2021-12-24 Christof Beierle , Gregor Leander