English
Related papers

Related papers: Nonvanishing $k$-flats of Boolean and vectorial fu…

200 papers

In two papers entitled ``Two generalizations of almost perfect nonlinearity" and ``On the vector subspaces of $\mathbb F_{2^n}$ over which the multiplicative inverse function sums to zero", the first author has introduced and studied the…

Number Theory · Mathematics 2025-08-05 Claude Carlet , Xiang-dong Hou

A function from $\Bbb F_{2^n}$ to $\Bbb F_{2^n}$ is said to be {\em $k$th order sum-free} if the sum of its values over each $k$-dimensional $\Bbb F_2$-affine subspace of $\Bbb F_{2^n}$ is nonzero. This notion was recently introduced by C.…

Number Theory · Mathematics 2025-10-17 Alyssa Ebeling , Xiang-dong Hou , Ashley Rydell , Shujun Zhao

We investigate the existence of Boolean degree $d$ functions on the Grassmann graph of $k$-spaces in the vector space $\mathbb{F}_q^n$. For $d=1$ several non-existence and classification results are known, and no non-trivial examples are…

Combinatorics · Mathematics 2022-11-14 Jan De Beule , Jozefien D'haeseleer , Ferdinand Ihringer , Jonathan Mannaert

A function $F:\mathbb{F}_{2}^{n}\to \mathbb{F}_{2}^{m}$ is called $k$th-order sum-free if the sum of its values over any $k$-dimensional affine subspace of $\mathbb{F}_2^n$ is non-zero. Carlet recently introduced this notion and constructed…

Information Theory · Computer Science 2026-05-25 Philipp Heering , Christian Kaspers , Vladislav Taranchuk

Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…

Combinatorics · Mathematics 2025-10-06 Michael Kiermaier , Jonathan Mannaert , Alfred Wassermann

We classify the Boolean degree $1$ functions of $k$-spaces in a vector space of dimension $n$ (also known as Cameron-Liebler classes) over the field with $q$ elements for $n \geq n_0(k, q)$. This also implies that two-intersecting sets with…

Combinatorics · Mathematics 2024-05-28 Ferdinand Ihringer

Nonvanishing theorems play a central role in birational geometry, since they derive geometric consequences from numerical information and constitute a crucial step towards abundance and semiampleness problems. General nonvanishing…

Algebraic Geometry · Mathematics 2025-10-22 Andreas Höring , Vladimir Lazić , Christian Lehn

A function from $\mathbb{F}_{2^n}$ to $\mathbb{F}_{2^n}$ is $k$th order sum-free if the sum of its values over each $k$-dimensional $\mathbb{F}_2$-affine subspace is nonzero. It is conjectured that for $n$ odd and prime,…

Number Theory · Mathematics 2025-12-08 Zoë Gemmell , Tim Trudgian

For every natural number k we introduce the notion of k-th order convolution of functions on abelian groups. We study the group of convolution preserving automorphisms of function algebras in the limit. It turns out that such groups have…

Combinatorics · Mathematics 2010-01-26 Balazs Szegedy

Let $(a_n)_{n\geq 0}$ be an arbitrary sequence and $(a_{\lfloor n/k \rfloor})_{n\geq 0}$ its dual floor sequence. We study infinite series and finite generalized binomial sums involving $(a_{\lfloor n/k \rfloor})_{n\geq 0}$. As applications…

Combinatorics · Mathematics 2023-03-29 Kunle Adegoke , Robert Frontczak , Taras Goy

In this paper, we consider sums related the floor function. We can improve some previous results for some special arithmetic functions considered by Bordell\'es [3], Stucky[9] and Liu-Wu-Yang [6]. We can also give a refined result for…

Number Theory · Mathematics 2023-10-03 Wei Zhang

We study the number of queries needed to identify a monotone Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$. A query consists of a 0-1-sequence, and the answer is the value of $f$ on that sequence. It is well-known that the number of…

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

Let $\xi_0, \xi_1, \dots$ be i.i.d. random variables with zero mean and unit variance. We study the following four families of random analytic functions: $\sum_{k=0}^n \sqrt{\binom nk} \xi_k z^k$ (spherical polynomials), $\sum_{k=0}^\infty…

Probability · Mathematics 2018-07-05 Hendrik Flasche , Zakhar Kabluchko

In the first part of this paper [16], some results on how to compute the flat spectra of Boolean constructions w.r.t. the transforms {I,H}^n, {H,N}^n and {I,H,N}^n were presented, and the relevance of Local Complementation to the quadratic…

Information Theory · Computer Science 2007-07-13 Constanza Riera , George Petrides , Matthew G. Parker

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…

Logic in Computer Science · Computer Science 2013-03-15 Ranjeet Kumar Rout , Pabitra Pal Choudhury , Sudhakar Sahoo

Noncommutative lattices have been recently used as finite topological approximations in quantum physical models. As a first step in the construction of bundles and characteristic classes over such noncommutative spaces, we shall study their…

q-alg · Mathematics 2008-02-03 Elisa Ercolessi , Giovanni Landi , Paulo Teotonio-Sobrinho

In this paper certain classes of infinite sums involving special functions are evaluated analytically by application of basic quantum mechanical principles to simple models of half harmonic oscillator and a particle trapped inside an…

In this paper, we study the value distributions of perfect nonlinear functions, i.e., we investigate the sizes of image and preimage sets. Using purely combinatorial tools, we develop a framework that deals with perfect nonlinear functions…

Combinatorics · Mathematics 2023-10-19 Lukas Kölsch , Alexandr Polujan

Dillon-like Boolean functions are known, in the literature, to be those trace polynomial functions from $\mathbb{F}_{2^{2n}}$ to $\mathbb{F}_{2}$, with all the exponents being multiples of $2^n-1$ often called Dillon-like exponents. This…

Discrete Mathematics · Computer Science 2024-11-26 Ziran Tu , Sihem Mesnager , Xiangyong Zeng , Nian Li , Yupeng Jiang , Yanan Deng
‹ Prev 1 2 3 10 Next ›