English
Related papers

Related papers: New P$c$N and AP$c$N functions over finite fields

200 papers

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…

Group Theory · Mathematics 2015-03-09 J. C. Birget

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…

Data Structures and Algorithms · Computer Science 2013-04-19 Nikhil R. Devanur , Shaddin Dughmi , Roy Schwartz , Ankit Sharma , Mohit Singh

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

In this article, we introduce new notions $cc$-differential uniformity, $cc$-differential spectrum, PccN functions and APccN functions, and investigate their properties. We also introduce $c$-CCZ equivalence, $c$-EA equivalence, and…

Information Theory · Computer Science 2023-01-24 Nhan-Phu Chung , Jaeseong Jeong , Namhun Koo , Soonhak Kwon

We define a switch function to be a function from an interval to $\{1,-1\}$ with a finite number of sign changes. (Special cases are the Walsh functions.) By a topological argument, we prove that, given $n$ real-valued functions, $f_1,…

Classical Analysis and ODEs · Mathematics 2018-04-16 Richard R. Hall , Eli Hawkins , Bernard S. Kay

Permutations over $F_{2^{2k}}$ with low differential uniform, high algebraic degree and high nonlinearity are of great cryptographical importance since they can be chosen as the substitution boxes (S-boxes) for many block ciphers. A well…

Information Theory · Computer Science 2014-07-21 Jie Peng , Chik How Tan , Qichun Wang

We generalize Newton-type methods for minimizing smooth functions to handle a sum of two convex functions: a smooth function and a nonsmooth function with a simple proximal mapping. We show that the resulting proximal Newton-type methods…

Machine Learning · Statistics 2014-03-19 Jason D. Lee , Yuekai Sun , Michael A. Saunders

We propose a novel class of neural network-like parametrized functions, i.e., general transformation neural networks (GTNNs), for high-dimensional approximation. Conventional deep neural networks sometimes perform less accurately on…

Numerical Analysis · Mathematics 2026-02-25 Xiaoyang Wang , Yiqi Gu

The investigation of partially APN functions has attracted a lot of research interest recently. In this paper, we present several new infinite classes of 0-APN power functions over $\mathbb{F}_{2^n}$ by using the multivariate method and…

Information Theory · Computer Science 2022-12-12 Yuying Man , Shizhu Tian , Nian Li , Xiangyong Zeng

In this paper we compute the Fourier spectra of some recently discovered binomial APN functions. One consequence of this is the determination of the nonlinearity of the functions, which measures their resistance to linear cryptanalysis.…

Discrete Mathematics · Computer Science 2008-12-18 Carl Bracken , Eimear Byrne , Nadya Markin , Gary McGuire

In this paper, we introduce a new subclass of close-to-convex harmonic functions. We present a sufficient coefficient condition for a function to be a member of this class. Furthermore, we establish a distortion theorem. These results lay…

Complex Variables · Mathematics 2025-02-10 Serkan Çakmak , Sibel Yalçin

In \cite{mccarthy2}, McCarthy defined a function $_{n}G_{n}[\cdots]$ using the Teichm\"{u}ller character of finite fields and quotients of the $p$-adic gamma function. This function extends hypergeometric functions over finite fields to the…

Number Theory · Mathematics 2014-03-17 Rupam Barman , Neelam Saikia

Probabilistic submeasures generalizing the classical (numerical) submeasures are introduced and discussed in connection with some classes of aggregation functions. A special attention is paid to triangular norm-based probabilistic…

Classical Analysis and ODEs · Mathematics 2012-07-12 Lenka Halčinová , Ondrej Hutník , Radko Mesiar

We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…

Computational Complexity · Computer Science 2020-10-23 Aniruddha Biswas , Palash Sarkar

We study a general class of weighted shifts whose weights $\alpha$ are given by $\alpha_n = \sqrt{\frac{p^n + N}{p^n + D}}$, where $p > 1$ and $N$ and $D$ are parameters so that $(N,D) \in (-1, 1)\times (-1, 1)$. Some few examples of these…

Functional Analysis · Mathematics 2026-05-12 Chafiq Benhida , Raul E. Curto , George R. Exner

The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…

Numerical Analysis · Mathematics 2016-06-28 Cleonice F. Bracciali , John H. McCabe , Teresa E. Pérez , A. Sri Ranga

We investigated some variational methods to compute a wavefunction based on antisymmetric product of geminals (APG). The Waring decomposition on the APG wavefunction leads a finite sum of antisymmetrized geminal power (AGP) wavefunctions,…

Chemical Physics · Physics 2024-10-10 Airi Kawasaki , Naoki Nakatani

Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…

Information Theory · Computer Science 2015-08-17 Guangkui Xu , Xiwang Cao

In this paper some cryptographic properties of Boolean functions, including weight, balancedness and nonlinearity, are studied, particularly focusing on splitting functions and cubic Boolean functions. Moreover, we present some quantities…

Cryptography and Security · Computer Science 2024-06-17 Augustine Musukwa , Massimiliano Sala , Marco Zaninelli

The goal of this paper is to introduce ideas and methodology of the generic case complexity to cryptography community. This relatively new approach allows one to analyze the behavior of an algorithm on ''most'' inputs in a simple and…

Computational Complexity · Computer Science 2008-02-27 Alex D. Myasnikov