English
Related papers

Related papers: On the linear structures of Balanced functions and…

200 papers

A balanced pair in a finite ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We prove that every finite $N$-free…

Combinatorics · Mathematics 2012-05-22 Imed Zaguia

Bent functions as optimal combinatorial objects are difficult to characterize and construct. In the literature, bent idempotents are a special class of bent functions and few constructions have been presented, which are restricted by the…

Information Theory · Computer Science 2015-08-25 Chunming Tang , Yanfeng Qi , Zhengchun Zhou , Cuiling Fan

The relationship between quantum physics and discrete mathematics is reviewed in this article. The Boolean functions unitary representation is considered. The relationship between Zhegalkin polynomial, which defines the algebraic normal…

Quantum Physics · Physics 2019-06-18 Yu. I. Bogdanov , N. A. Bogdanova , D. V. Fastovets , V. F. Lukichev

The present work considers the properties of classes of generally convex sets in the plane known as $1$-semiconvex and weakly $1$-semiconvex. More specifically, the examples of open and closed weakly $1$-semiconvex but non $1$-semiconvex…

Metric Geometry · Mathematics 2020-02-11 T. M. Osipchuk

We prove that 1) There exist infinitely many non-trivial codimension one "thick" knots in $\mathbb{R}^5$; 2) For each closed four-dimensional smooth manifold $M$ and for each sufficiently small positive $\epsilon$ the set of isometry…

Metric Geometry · Mathematics 2016-03-17 Boris Lishak , Alexander Nabutovsky

In this paper, we investigate properties of functions from $\mathbb{Z}_{p}^n$ to $\mathbb{Z}_q$, where $p$ is an odd prime and $q$ is a positive integer divided by $p$. we present the sufficient and necessary conditions for bent-ness of…

Number Theory · Mathematics 2016-05-10 Libo Wang , Baofeng Wu , Zhuojun Liu

Generalized circuits are an important tool in the study of the computational complexity of equilibrium approximation problems. However, in this paper, we reveal that they have a conceptual flaw, namely that the solution concept is not…

Computational Complexity · Computer Science 2019-07-31 Steffen Schuldenzucker , Sven Seuken

We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the…

Data Structures and Algorithms · Computer Science 2014-02-11 Ferdinando Cicalese , Travis Gagie , Eduardo Laber , Martin Milanic

In 2018, Pott, at al. have studied in [IEEE Transactions on Information Theory. Volume: 64, Issue: 1, 2018] the maximum number of bent components of vectorial function. They have presented serval nice results and suggested several open…

Information Theory · Computer Science 2018-01-23 Sihem Mesnager , Fengrong Zhang , Chunming Tang , Yong Zhou

We derive the structural relations between nested harmonic sums and the corresponding Mellin transforms of Nielsen integrals and harmonic polylogarithms at weight {\sf w = 6}. They emerge in the calculations of massless single--scale…

Mathematical Physics · Physics 2010-11-11 Johannes Blümlein

In this paper, we establish a lower bound on the total number of inequivalent APN functions on the finite field with $2^{2m}$ elements, where $m$ is even. We obtain this result by proving that the APN functions introduced by Pott and the…

Combinatorics · Mathematics 2020-02-05 Christian Kaspers , Yue Zhou

Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…

Discrete Mathematics · Computer Science 2017-07-27 Nicolas Bonichon , Benjamin Lévêque

We describe the structure of the monoid of natural-valued monotone functions on an arbitrary poset. For this monoid we provide a presentation, a characterization of prime elements, and a description of its convex hull. We also study the…

Combinatorics · Mathematics 2021-02-16 Winfried Bruns , Pedro A. García-Sánchez , Luca Moci

We consider geometrical properties of the polarized and unpolarized structure functions and provide definition for the $b$--dependent structure functions. It is shown that unitarity does not allow factorized form of the structure functions…

High Energy Physics - Phenomenology · Physics 2007-05-23 Sergey Troshin , Nikolai Tyurin

Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes…

Information Theory · Computer Science 2016-02-05 Chunming Tang , Can Xiang , Keqin Feng

The property of balance (in the sense of Feder and Mihail) is investigated in the context of paving matroids. The following examples are exhibited: (a) a class of ``sparse'' paving matroids that are balanced, but at the same time rich…

Combinatorics · Mathematics 2007-05-23 Mark Jerrum

A "numerical set-expression" is a term specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. If these operations are confined to the usual Boolean operations together with the result of…

Logic in Computer Science · Computer Science 2024-04-24 Ian Pratt-Hartmann , Ivo Düntsch

The Poisson structures for 3D systems possessing one constant of motion can always be constructed from the solution of a linear PDE. When two constants of the motion are available the problem reduces to a quadrature and the structure…

Mathematical Physics · Physics 2009-11-07 F. Haas , J. Goedert

The resonance arrangement $\mathcal{A}_n$ is the arrangement of hyperplanes which has all non-zero $0/1$-vectors in $\mathbb{R}^n$ as normal vectors. It is the adjoint of the Braid arrangement and is also called the all-subsets arrangement.…

Combinatorics · Mathematics 2025-05-21 Lukas Kühne

In this work, we employ the concept of {\em composite representation} of Boolean functions, which represents an arbitrary Boolean function as a composition of one Boolean function and one vectorial function, for the purpose of specifying…

Information Theory · Computer Science 2018-09-21 S. Hodžić , E. Pasalic , Y. Wei