English
Related papers

Related papers: Decomposing generalized bent and hyperbent functio…

200 papers

Generalised definitions of exponential, trigonometric sine and cosine and hyperbolic sine and cosine functions are given. In the lowest order, these functions correspond to ordinary exponential, trigonometric sine etc. Some of the…

Mathematical Physics · Physics 2007-05-23 Debasis Biswas , S. Biswas , Asoke P. Chattopadhyay

Recently Dixit, Kesarwani, and Moll introduced a generalization $K_{z,w}(x)$ of the modified Bessel function $K_{z}(x)$ and showed that it satisfies an elegant theory similar to $K_{z}(x)$. In this paper, we show that while…

Classical Analysis and ODEs · Mathematics 2018-10-09 Rahul Kumar

The main object of this paper is to present a new generalized beta function which defined by three parametres Mittag-Leffler function. We also introduce new generalizations of hypergeometric and confluent hypergeometric functions with the…

Classical Analysis and ODEs · Mathematics 2018-03-09 Muhammed Ay

Bent functions are Boolean functions in an even number of variables that are indicators of Hadamard difference sets in elementary abelian 2-groups. A bent function in m variables is said to be normal if it is constant on an affine space of…

Discrete Mathematics · Computer Science 2025-05-01 Valérie Gillot , Philippe Langevin , Alexandr Polujan

In the BFA 2023 conference paper, A. Polujan, L. Mariot and S. Picek exhibited the first example of a non-normal but weakly normal bent function in dimension 8. In this note, we present numerical approaches based on the classification of…

Discrete Mathematics · Computer Science 2024-07-23 Valérie Gillot , Philippe Langevin , Alexandr Polujan

For each non-constant $q$ in the set of $n$-variable Boolean functions, the {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable from $q$ by nonsingular linear change of…

Cryptography and Security · Computer Science 2017-11-09 Zhixiong Chen , Ting Gu , Andrew Klapper

Let $\mathbb{F}_{p^{n}}$ be the finite field with $p^n$ elements and $\operatorname{Tr}(\cdot)$ be the trace function from $\mathbb{F}_{p^{n}}$ to $\mathbb{F}_{p}$, where $p$ is a prime and $n$ is an integer. Inspired by the works of…

Information Theory · Computer Science 2021-08-03 Xi Xie , Nian Li , Xiangyong Zeng , Xiaohu Tang , Yao Yao

In the paper, we introduce the generalized convex function on fractal sets of real line numbers and study the properties of the generalized convex function. Based on these properties, we establish the generalized Jensen inequality and…

Classical Analysis and ODEs · Mathematics 2014-06-30 Huixia Mo , Xin Sui , Dongyan Yu

We present some recent progresses on Heun functions, gathering results from classical analysis up to elliptic functions. We describe Picard's generalization of Floquet's theory for differential equations with doubly periodic coefficients…

Mathematical Physics · Physics 2007-05-23 Galliano Valent

We study the nonlinearity of functions defined on a finite field with 2^m elements which are the trace of a polynomial of degree 7 or more general polynomials. We show that for m odd such functions have rather good nonlinearity properties.…

Number Theory · Mathematics 2007-05-23 Eric Férard , François Rodier

In this paper our aim is to present some Landen inequalities for Gaussian hypergeometric functions, confluent hypergeometric functions, generalized Bessel functions and for general power series. Our main results complement and generalize…

Classical Analysis and ODEs · Mathematics 2014-07-10 Árpád Baricz

Recently, there emerges different versions of beta function and hypergeometric functions containing extra parameters. Gaining enlightenment from these ideas, we will first introduce a new extension of generalized hypergeometric function and…

Classical Analysis and ODEs · Mathematics 2013-02-12 Luo Minjie

Negabent functions were introduced as a generalization of bent functions, which have applications in coding theory and cryptography. In this paper, we have extended the notion of negabent functions to the functions defined from…

Discrete Mathematics · Computer Science 2022-07-25 Deep Singh , Maheshanand Bhaintwal

In this paper a new class of radial basis functions based on hyperbolic trigonometric functions will be introduced and studied. We focus on the properties of their generalised Fourier transforms with asymptotics. Therefore we will compute…

Numerical Analysis · Mathematics 2025-05-21 Martin Buhmann , Joaquín Jódar , Miguel L. Rodríguez

The number of $n$-ary bent functions is less than $2^{3\cdot2^{n-3}(1+o(1))}$ as $n$ is even and $n\rightarrow\infty$. Keywords: Boolean function, bent function, upper bound

Information Theory · Computer Science 2023-03-30 Vladimir N. Potapov

In 1999 Bernasconi and Codenotti noted that the Cayley graph of a bent function is strongly regular. This paper describes the concept of extended Cayley equivalence of bent functions, discusses some connections between bent functions,…

Combinatorics · Mathematics 2018-12-13 Paul Leopardi

Two classes of ternary bent functions of degree four with two and three terms in the univariate representation that belong to the completed Maiorana-McFarland class are found. Binomials are mappings $\F_{3^{4k}}\mapsto\fthree$ given by…

Discrete Mathematics · Computer Science 2025-07-29 Tor Helleseth , Alexander Kholosha , Niki Spithaki

Using the existence of infinite numbers $k$ in the non-Archimedean ring of Robinson-Colombeau, we define the hyperfinite Fourier transform (HFT) by considering integration extended to $[-k,k]^{n}$ instead of $(-\infty,\infty)^{n}$. In order…

Functional Analysis · Mathematics 2022-10-03 Akbarali Mukhammadiev , Diksha Tiwari , Paolo Giordano

The functional ANOVA, or Hoeffding decomposition, provides a principled framework for interpretability by decomposing a model prediction into main effects and higher-order interactions. For independent inputs, this classical decomposition…

Machine Learning · Statistics 2026-05-19 Baptiste Ferrere , Nicolas Bousquet , Fabrice Gamboa , Jean-Michel Loubes

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
‹ Prev 1 3 4 5 6 7 10 Next ›