English
Related papers

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

200 papers

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

Combinatorics · Mathematics 2014-02-26 Gareth A. Jones

A generating function is given for the number, $E(l,k)$, of irreducible $k$-fold Euler sums, with all possible alternations of sign, and exponents summing to $l$. Its form is remarkably simple: $\sum_n E(k+2n,k) x^n = \sum_{d|k}\mu(d)…

High Energy Physics - Theory · Physics 2008-02-03 D. J. Broadhurst

We show that any free product of finite-dimensional von Neumann algebras equipped with non-tracial states is isomorphic to a free Araki-Woods factor with its free quasi-free state possibly direct sum a finite-dimensional von Neumann…

Operator Algebras · Mathematics 2021-02-25 Michael Hartglass , Brent Nelson

An automorphism of order $n$ of a K3 surface is called purely non-symplectic if it multiplies the holomorphic symplectic form by a primitive $n$-th root of unity. We give the classification of purely non-symplectic automorphisms with…

Algebraic Geometry · Mathematics 2022-03-29 Simon Brandhorst

We consider the Stochastic Boolean Function Evaluation (SBFE) problem in the well-studied case of $k$-of-$n$ functions: There are independent Boolean random variables $x_1,\dots,x_n$ where each variable $i$ has a known probability $p_i$ of…

Data Structures and Algorithms · Computer Science 2025-11-25 Mads Anker Nielsen , Lars Rohwedder , Kevin Schewior

Given a prior probability distribution over a set of possible oracle functions, we define a number of queries to be useless for determining some property of the function if the probability that the function has the property is unchanged…

Quantum Physics · Physics 2010-04-12 David A. Meyer , James Pommersheim

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…

Combinatorics · Mathematics 2010-02-09 Jerome Kelleher

Classification of complex wave functions of infinite variables is an important problem since it is related to the classification of possible quantum states of matter. In this paper, we propose a way to classify symmetric polynomials of…

Strongly Correlated Electrons · Physics 2009-11-13 Xiao-Gang Wen , Zhenghan Wang

For any $k>1$, we find the asymptotics of the counting function of $k$-th power-free elements in an additive arithmetic semigroup with exponential growth of the abstract prime counting function. This paper continues the authors' earlier…

Number Theory · Mathematics 2016-04-13 V. L. Chernyshev , D. S. Minenkov , V. E. Nazaikinskii

We show that the problem of counting the number of $n$-variable unate functions reduces to the problem of counting the number of $n$-variable monotone functions. Using recently obtained results on $n$-variable monotone functions, we obtain…

Combinatorics · Mathematics 2023-10-04 Aniruddha Biswas , Palash Sarkar

We develop methods for proving that certain extensions of polynomial functors do not split naturally. As an application we give a functorial description of the third and the fourth stable homotopy groups of the classifying spaces of free…

Algebraic Topology · Mathematics 2012-10-05 Roman Mikhailov

We extend the notion of combinatorial discrepancy to \emph{non-additive} functions. Our main result is an upper bound of $O(\sqrt{n \log(nk)})$ on the non-additive $k$-color discrepancy when $k$ is a prime power. We demonstrate two…

Computer Science and Game Theory · Computer Science 2025-09-23 Max Dupre la Tour , Kaito Fujii

We consider a certain class of multiplicative functions $f: \mathbb N \rightarrow \mathbb C$ and study the distribution of zeros of Dirichlet polynomials $F_N(s)= \sum_{n\le N} f(n)n^{-s}$ corresponding to these functions. We prove that the…

Number Theory · Mathematics 2019-12-10 Arindam Roy , Akshaa Vatwani

We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions $\{0,1\}^k\to\mathbb{R}_{\geq 0}$) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice…

Discrete Mathematics · Computer Science 2018-04-13 Andrei Bulatov , Leslie Ann Goldberg , Mark Jerrum , David Richerby , Stanislav Živný

The aim of this paper is to offer an algebraic construction of infinite-dimensional Grassmannians and determinant bundles (and therefore valid for arbitrary base fields). As an application we construct the $\tau$-function and formal…

alg-geom · Mathematics 2016-08-15 A. Álvarez Vázquez , J. M. Muñoz Porras , F. J. Plaza Martín

In this work we introduce new combinatorial objects called $d$--fold partition diamonds, which generalize both the classical partition function and the partition diamonds of Andrews, Paule and Riese, and we set $r_d(n)$ to be their counting…

Number Theory · Mathematics 2024-05-10 Dalen Dockery , Marie Jameson , James A. Sellers , Samuel Wilson

We investigate the width complexity of nondeterministic unitary OBDDs (NUOBDDs). Firstly, we present a generic lower bound on their widths based on the size of strong 1-fooling sets. Then, we present classically cheap functions that are…

Computational Complexity · Computer Science 2016-12-22 Aida Gainutdinova , Abuzer Yakaryılmaz

We introduce and study a multivariate function that counts nowhere-zero flows on a graph G, in which each edge of G has an individual capacity. We prove that the associated counting function is a piecewise-defined polynomial in these…

Combinatorics · Mathematics 2016-05-10 Matthias Beck , Alyssa Cuyjet , Gordon Rojas Kirby , Molly Stubblefield , Michael Young

A boolean function of $n$ boolean variables is {correlation-immune} of order $k$ if the function value is uncorrelated with the values of any $k$ of the arguments. Such functions are of considerable interest due to their cryptographic…

We consider the problem of computing the Boolean convolution (with wraparound) of $n$~vectors of dimension $m$, or, equivalently, the problem of computing the sumset $A_1+A_2+\ldots+A_n$ for $A_1,\ldots,A_n \subseteq \mathbb{Z}_m$. Boolean…

Data Structures and Algorithms · Computer Science 2021-05-11 Karl Bringmann , Vasileios Nakos