English
Related papers

Related papers: On the normality of Boolean quartics

200 papers

Starting from special near-bent functions in dimension 2t-1 we construct bent functions in dimension 2t having a specific derivative. We deduce new famillies of bent functions

Information Theory · Computer Science 2014-05-23 Jacques Wolfmann

This paper studies the $H^0$ norm and $H^1$ seminorm of quadratic functions. The (semi)norms are expressed explicitly in terms of the coefficients of the quadratic function under consideration when the underlying domain is an $l_p$-ball (1…

Optimization and Control · Mathematics 2012-02-01 Zaikun Zhang

This paper addresses the problem of regularity properties of functions represented as an expansion in a wavelet basis with random coefficients in terms of finiteness of their Besov norm with probability 1. Such representations are used to…

Statistics Theory · Mathematics 2013-10-24 Natalia Bochkina

We present a few algorithms and methods to count fixes of permutations acting on monotone Boolean functions. Some of these methods was used by Pawelski \cite{P} to compute the number of inequivalent monotone Boolean functions with 8…

Combinatorics · Mathematics 2022-05-10 Andrzej Szepietowski

Many underlying structural and functional factors that determine the fault behavior of a combinational network, are not yet fully understood. In this paper, we show that there exists a large class of Boolean functions, called root…

Other Computer Science · Computer Science 2013-09-17 Debesh K. Das , Debabani Chowdhury , Bhargab B. Bhattacharya , Tsutomu Sasao

We show that if $f$ is an integer-valued function with spectral norm at most $M$ then there are subspaces $V_1,\dots,V_L$ and signs $\sigma_1,\dots,\sigma_L \in \{-1,1\}$ such that $f=\sigma_1 1_{V_1} + \dots + \sigma_L 1_{V_L}$ where $L <…

Classical Analysis and ODEs · Mathematics 2019-08-15 Tom Sanders

We consider spacelike surfaces in the four-dimensional Minkowski space and introduce geometrically an invariant linear map of Weingarten-type in the tangent plane at any point of the surface under consideration. This allows us to introduce…

Differential Geometry · Mathematics 2012-05-30 Georgi Ganchev , Velichka Milousheva

We consider negabent Boolean functions that have Trace representation. We completely characterize quadratic negabent monomial functions. We show the relation between negabent functions and bent functions via a quadratic function. Using this…

Information Theory · Computer Science 2014-06-05 Sumanta Sarkar

We discuss the statistical properties of the volume of the nodal set of wave function for two paradigmatic model systems which we consider in arbitrary dimension $s\ge 2$: the cuboid as a paradigm for a regular shape with separable wave…

Mathematical Physics · Physics 2014-03-05 Sven Gnutzmann , Stylianos Lois

We study normality of a family of meromorphic functions, whose differential polynomials satisfy a certain condition, which significantly improves and generalizes some recent results of Chen (Filomat, 31(14) 2017, 4665-4671). Moreover, we…

Complex Variables · Mathematics 2025-07-03 Nikhil Bharti , Anil Singh

It is disproved the Tokareva's conjecture that any balanced boolean function of appropriate degree is a derivative of some bent function. This result is based on new upper bounds for the numbers of bent and plateaued functions.

Information Theory · Computer Science 2025-12-01 Vladimir N. Potapov

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

Computational Complexity · Computer Science 2015-02-05 Chia-Jung Lee , Satya V. Lokam , Shi-Chun Tsai , Ming-Chuan Yang

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

Data Structures and Algorithms · Computer Science 2015-04-08 Ishay Haviv , Oded Regev

We study the polynomial functions on tensor states in $(C^n)^{\otimes k}$ which are invariant under $SU(n)^k$. We describe the space of invariant polynomials in terms of symmetric group representations. For $k$ even, the smallest degree for…

Quantum Physics · Physics 2007-05-23 Jean-Luc Brylinski , Ranee Brylinski

One can consider $\mu$-Martin-L\"of randomness for a probability measure $\mu$ on $2^{\omega}$, such as the Bernoulli measure $\mu_p$ given $p \in (0, 1)$. We study Bernoulli randomness of sequences in $n^{\omega}$ with parameters $p_0,…

Logic · Mathematics 2020-11-30 Andrew DeLapo

Fourier analysis on the Boolean hypercube is fundamentally defined as the orthogonal decomposition of the space of pseudo-Boolean functions with respect to the uniform probability measure. In this work, we propose an ANOVA-based…

Machine Learning · Statistics 2026-03-03 Baptiste Ferrere , Nicolas Bousquet , Fabrice Gamboa , Jean-Michel Loubes , Joseph Muré

In the literature, few constructions of $n$-variable rotation symmetric bent functions have been presented, which either have restriction on $n$ or have algebraic degree no more than $4$. In this paper, for any even integer $n=2m\ge2$, a…

Information Theory · Computer Science 2015-05-13 Sihong Su , Xiaohu Tang

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

In the literature on slice analysis in the hypercomplex setting, there are two main approaches to define slice regular functions in one variable: one consists in requiring that the restriction to any complex plane is holomorphic (with the…

Complex Variables · Mathematics 2024-06-28 Xinyuan Dou , Guangbin Ren , Irene Sabadini , Ting Yang

The probabilistic degree of a Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is defined to be the smallest $d$ such that there is a random polynomial $\mathbf{P}$ of degree at most $d$ that agrees with $f$ at each point with high…

Computational Complexity · Computer Science 2019-10-08 Srikanth Srinivasan , Utkarsh Tripathi , S. Venkitesh
‹ Prev 1 4 5 6 7 8 10 Next ›