Related papers: A Note on Vectorial Boolean Functions as Embedding…

The Kronecker coefficients are the structure constants for the restriction of irreducible representations of the general linear group $GL(n m)$ into irreducibles for the subgroup $GL(n)\times GL(m)$. In this work we study the…

Suppose that $Y^n$ is obtained by observing a uniform Bernoulli random vector $X^n$ through a binary symmetric channel with crossover probability $\alpha$. The "most informative Boolean function" conjecture postulates that the maximal…

We prove that whenever $M_1,\dots,M_n\colon I^k \to I$, ($n,k \in \mathbb{N}$) are symmetric, continuous means on the interval $I$ and $S_1,\dots,S_m\colon I^k \to I$ ($m <n$) satisfies a sort of embeddability assumptions then for every…

This study intends to introduce kernel mean embedding of probability measures over infinite-dimensional separable Hilbert spaces induced by functional response statistical models. The embedded function represents the concentration of…

Let $S$ be a semigroup, let $n\in\mathbb{N}$ be a positive natural number, let $A,B\subseteq S$, let $\mathcal{U},\mathcal{V}\in\beta S$ and let let $\mathcal{F}\subseteq\{f:S^{n}\rightarrow S\}$. We say that $A$ is $\mathcal{F}$-finitely…

Spectral embedding finds vector representations of the nodes of a network, based on the eigenvectors of a properly constructed matrix, and has found applications throughout science and technology. Many networks are multipartite, meaning…

Characterizing the solution sets in a problem by closedness under operations is recognized as one of the key aspects of algorithm development, especially in constraint satisfaction. An example from the Boolean satisfiability problem is that…

We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…

Identifying the relationships among program elements is useful for program understanding, debugging, and analysis. One such relationship is synonymy. Function synonyms are functions that play a similar role in code, e.g. functions that…

In \cite{D3}, Donaldson defines a dynamical system on the space of Fubini-Study metrics on a polarized compact K\"ahler manifold. Sano proved that if there exists a balanced metric for the polarization, then this dynamical system always…

A tantalizing conjecture in discrete mathematics is the one of Koml\'os, suggesting that for any vectors $\mathbf{a}_1,\ldots,\mathbf{a}_n \in B_2^m$ there exist signs $x_1, \dots, x_n \in \{ -1,1\}$ so that $\|\sum_{i=1}^n…

The use of charge balance functions in heavy-ion collision studies was initially proposed as a probe of delayed hadronization and two-stage quark production in these collisions. It later emerged that general balance functions can also serve…

Boolean functions with good cryptographic criteria when restricted to the set of vectors with constant Hamming weight play an important role in the recent FLIP stream cipher. In this paper, we propose a large class of weightwise perfectly…

In mathematical modeling, it is common to have an equation $F(p)=c$ where the exact form of $F$ is not known. This article shows that there are large classes of $F$ where almost all $F$ share the same properties. The classes we investigate…

We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…

If a function $f$, acting on a Euclidean space $\mathbb{R}^n$, is "almost" orthogonally additive in the sense that $f(x+y)=f(x)+f(y)$ for all $(x,y)\in\bot\setminus Z$, where $Z$ is a "negligible" subset of the $(2n-1)$-dimensional manifold…

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…

We show examples of total Boolean functions that depend on $n$ variables and have spectral sensitivity $\Theta(\sqrt{\log n})$, which is asymptotically minimal. Our main new function combines the Hamming code with the Boolean address…

The role of symmetry in Boolean functions $f:\{0,1\}^n \to \{0,1\}$ has been extensively studied in complexity theory. For example, symmetric functions, that is, functions that are invariant under the action of $S_n$, is an important class…

Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…