Related papers: A relation between additive and multiplicative com…
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…
In this note, we give a positive answer to a question raised by Jean-Pierre Demailly in 2013, and show the additivity of the approximation functional of closed positive $(1,1)$-currents induced by Bergman kernels.
We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence…
We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite then the complexity of hyperfinite countable Borel equivalence relations is as high as possible, namely,…
We investigate the relationship between (countable) transfinite iteration and ordinal arithmetic. The nice connection between finite iteration and addition, multiplication, and exponentiation is lost when passing to the transfinite. In this…
We prove an asymptotic formula for the number of Eulerian circuits for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up to the multiplicative error $O(n^{-1/2+\varepsilon})$, where…
The multiplicative anomaly related to the functional regularized determinants involving products of elliptic operators is introduced and some of its properties discussed. Its relevance concerning the mathematical consistency is stressed.…
Since the 90's, several authors have studied a probability distribution on the set of Boolean functions on $n$ variables induced by some probability distributions on formulas built upon the connectors $And$ and $Or$ and the literals…
We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…
We develop a notion of computability and complexity of functions over the reals, which seems to be very natural when one tries to determine just how "difficult" a certain function is. This notion can be viewed as an extension of both BSS…
While it is known that there is at most a polynomial separation between quantum query complexity and the polynomial degree for total functions, the precise relationship between the two is not clear for partial functions. In this paper, we…
In this paper we study the relationship between vectorial (Boolean) functions and cyclic codes in the context of algebraic attacks. We first derive a direct link between the annihilators of a vectorial function (in univariate form) and…
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…
The action of a Weyl group on the associated weight lattice induces an additive action on the symmetric algebra and a multiplicative action on the group algebra of the lattice. We show that the coinvariant space of the multiplicative action…
We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.
In this paper we prove the mean values of some multiplicative functions connected with the divisor function on the short interval of summation.
Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients.…
This paper gives a dichotomy theorem for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem. The problem is parameterised by a finite set F of non-negative functions that…
The objective of this paper is the study of functions which only act on the digits of an expansion. In particular, we are interested in the asymptotic distribution of the values of these functions. The presented result is an extension and…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…