English
Related papers

Related papers: Constructing $2m$-variable Boolean functions with …

200 papers

Correlation-immune (CI) multi-output Boolean functions have the property of keeping the same output distribution when some input variables are fixed. Recently, a new application of CI functions has appeared in the system of resisting…

Information Theory · Computer Science 2019-08-27 Jinjin Chai , Zilong Wang , Sihem Mesnager , Guang Gong

We develop a variant of Coleman and Perrin Riou's methods giving, for a de Rham $p$-adic Galois representation, a construction of $p$-adic $L$ functions from a compatible system of global elements. As a result, we construct analytic…

Number Theory · Mathematics 2018-07-25 Joaquin Rodrigues Jacinto

We give an algebraic (non-analytic) proof of the deformed boson-fermion Fock space construction of Molev's double supersymmetric Schur functions, among other results, from our previous paper. In other words, we make no assumptions on the…

Combinatorics · Mathematics 2025-02-06 Daniel Bump , Andrew Hardt , Travis Scrimshaw

Mutually unbiased bases plays a central role in quantum mechanics and quantum information processing. As an important class of mutually unbiased bases, mutually unbiased maximally entangled bases (MUMEBs) in bipartite systems have attracted…

Information Theory · Computer Science 2020-01-01 Dengming Xu

We study the Dehn function of connected Lie groups. We show that this function is always exponential or polynomially bounded, according to the geometry of weights and of the 2-cohomology of their Lie algebras. Our work, which also addresses…

Group Theory · Mathematics 2017-07-11 Yves Cornulier , Romain Tessera

We prove that the homogeneously polyanalytic functions of total order $m$, defined by the system of equations $\overline{D}^{(k_1,\ldots,k_n)} f=0$ with $k_1+\cdots+k_n=m$, can be written as polynomials of total degree $<m$ in variables…

Complex Variables · Mathematics 2021-09-15 Christian Rene Leal-Pacheco , Egor A. Maximenko , Gerardo Ramos-Vazquez

In this paper, we determine the complex-valued solutions of the functional equation $$ f(x\sigma(y))+f(\tau(y)x)=2f(x)f(y)$$ for all $x,y \in M$, where $M$ is a monoid, $\sigma$: $M\longrightarrow M$ is an involutive automorphism and…

General Mathematics · Mathematics 2020-10-09 Chahbi Abdellatif , Elqorachi Elhoucien

We study the family of depolarizations of a squarefree monomial ideal $I$, i.e. all monomial ideals whose polarization is $I$. We describe a method to find all depolarizations of $I$ and study some of the properties they share and some they…

Commutative Algebra · Mathematics 2020-03-12 Fatemeh Mohammadi , Patricia Pascual-Ortigosa , Eduardo Sáenz-de-Cabezón , Henry P. Wynn

A conformal partition function ${\cal P}_n^m(s)$, which arose in the theory of Diophantine equations supplemented with additional restrictions, is concerned with {\it self-dual symmetric polynomials} -- reciprocal ${\sf R}^{\{m\}}_ {S_n}$…

Number Theory · Mathematics 2007-05-23 Leonid G. Fel

We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…

Numerical Analysis · Mathematics 2025-12-17 Álvaro Fernández Corral , Yahya Saleh

We give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of…

Logic · Mathematics 2013-05-14 Luca Motto Ros

Motivated by partition regularity problems of homogeneous quadratic equations, we prove multiple recurrence and convergence results for multiplicative measure preserving actions with iterates given by rational sequences involving…

Dynamical Systems · Mathematics 2025-07-17 Nikos Frantzikinakis

Our goal is to construct mathematical operations that combine indeterminism measured from quantum randomness with computational determinism so that non-mechanistic behavior is preserved in the computation. Formally, some results about…

Logic · Mathematics 2020-11-20 Michael Stephen Fiske

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

Combinatorics · Mathematics 2024-10-29 V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov

Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they…

Combinatorics · Mathematics 2024-06-10 Kristóf Bérczi , Boglárka Gehér , András Imolay , László Lovász , Tamás Schwarcz

The separation between two theorems in reverse mathematics is usually done by constructing a Turing ideal satisfying a theorem P and avoiding the solutions to a fixed instance of a theorem Q. Lerman, Solomon and Towsner introduced a forcing…

Logic · Mathematics 2015-03-13 Ludovic Patey

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

Logic · Mathematics 2016-01-15 Saharon Shelah

Consider a_1,a_2,...,a_n, arbitrary elements of R. We characterize those real functions f that decompose into the sum of a_j-periodic functions, i.e., f=f_1+...+f_n with D_{a_j}f(x):=f(x+a_j)-f(x)=0. We show that f has such a decomposition…

Classical Analysis and ODEs · Mathematics 2007-05-25 Bálint Farkas , Viktor Harangi , Tamás Keleti , Szilárd Gy. Révész

Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were introduced by Rothaus in 1976 when he…

Information Theory · Computer Science 2012-05-08 Chunming Tang , Yanfeng Qi , Maozhi Xu , Baocheng Wang , Yixian Yang

The Boolean product $R = P \cdot Q$ of two $\{ 0, 1\} \; m \times m \; $ matrices is $$R(j,k) = 1 \; \mathrm{\ IF\ for\ some\ } \; t \; \,P(j, t) = Q(t, k) = 1\; \; \mathrm{ELSE\ } \, R(j, k) = 0. $$ The near-optimal design reduces the…

Combinatorics · Mathematics 2018-08-27 Eli Shamir
‹ Prev 1 4 5 6 7 8 10 Next ›