相关论文: A DNC function that computes no effectively bi-imm…

We present a simple way to derive the results of Diaconis and Fulman [arXiv:1102.5159] in terms of noncommutative symmetric functions.

We propose an AC-independent proof of the existence of a non-measurable set as a consequence of the Hahn-Banach theorem of functional analysis which is known to be strictly weaker than AC.

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…

Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…

A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right…

The study of the Dirac system and second-order elliptic equations with complex-valued coefficients on the plane leads to bicomplex Vekua equations. To the difference of complex pseudoanalytic (generalized analytic) functions the theory of…

We give counterexamples to a conjecture of Benny Chor and another of the second author, both from the late 80s, by exhibiting functions for which the influences of large coalitions are unexpectedly small relative to the expectations of the…

We construct two computable topologically conjugate functions for which no conjugacy is computable, or even hyperarithmetic, resolving an open question of Kennedy and Stockman.

The proposed system of integer functions is logically fully independent from the traditional mathematical analysis of the real functions, but there is a well-defined mutual correspondence between the two disciplines. The system of integer…

We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…

We study deep neural networks with binary activation functions (BDNN), i.e. the activation function only has two states. We show that the BDNN can be reformulated as a mixed-integer linear program which can be solved to global optimality by…

On each nonreflexive Banach space X there exists a positive continuous convex function f such that 1/f is not a d.c. function (i.e., a difference of two continuous convex functions). This result together with known ones implies that X is…

We give solutions to two of the questions in a paper by Brendle, Brooke-Taylor, Ng and Nies. Our examples derive from a 2014 construction by Khan and Miller as well as new direct constructions using martingales. At the same time, we…

Multiset functions, which are functions that map multisets to vectors, are a fundamental tool in the construction of neural networks for multisets and graphs. To guarantee that the vector representation of the multiset is faithful, it is…

Constructing $2m$-variable Boolean functions with optimal algebraic immunity based on decomposition of additive group of the finite field $\mathbb{F}_{2^{2m}}$ seems to be a promising approach since Tu and Deng's work. In this paper, we…

We describe a new class of Boolean functions which provide the presently best known trade-off between low computational complexity, nonlinearity and (fast) algebraic immunity. In particular, for $n\leq 20$, we show that there are functions…

In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

In this paper we are concerned with the classification of the finite groups admitting a bipartite DRR and a bipartite GRR. First, we find a natural obstruction in a finite group for not admitting a bipartite GRR. Then we give a complete…

We prove two versions of Bochner's theorem for locally compact quantum groups. First, every completely positive definite "function" on a locally compact quantum group $\G$ arises as a transform of a positive functional on the universal…