Related papers: On Symmetric Pseudo-Boolean Functions: Factorizati…

We define a new basis of the algebra of quasi-symmetric functions by lifting the cycle-index polynomials of symmetric groups to noncommutative polynomials with coefficients in the algebra of free quasi-symmetric functions, and then…

We develop a singular pseudodifferential calculus. The symbols that we consider do not satisfy the standard decay with respect to the frequency variables. We thus adopt a strategy based on the Calderon-Vaillancourt Theorem. The remainders…

A space-filling function is a bijection from the unit line segment to the unit square, cube, or hypercube. The function from the unit line segment is continuous. The inverse function, while well-defined, is not continuous. Space-filling…

This paper explores a fine-grained version of the Watrous conjecture, including the randomized and quantum algorithms with success probabilities arbitrarily close to $1/2$. Our contributions include the following: i) An analysis of the…

We develop the concept of supersymmetry in singular spaces, apply it in an example for 3-branes in D=5 and comment on 8-branes in D=10. The new construction has an interpretation that the brane is a sink for the flux and requires adding to…

By using a new way to encode Boolean functions in a reversible gate, an algorithm is developed in quantum computing over Z_2, symbolized QC/2, (as opposed to QC over C) that needs only one function evaluation to solve the Grover Database…

A Pseudo-Boolean (PB) constraint is a linear arithmetic constraint over Boolean variables. PB constraints are convenient and widely used in expressing NP-complete problems. We introduce a new, two step, method for transforming PB…

We prove that every randomized Boolean function admits a supersimulator: a randomized polynomial-size circuit whose output on random inputs cannot be efficiently distinguished from reality with constant advantage, even by polynomially…

A logical function can be used to characterizing a property of a state of Boolean network (BN), which is considered as an aggregation of states. To illustrate the dynamics of a set of logical functions, which characterize our concerned…

Many underlying structural and functional factors that determine the fault behavior of a combinational network, are not yet fully understood. In this paper, we show that there exists a large class of Boolean functions, called root…

We study a new kind of symmetric polynomials P_n(x_1,...,x_m) of degree n in m real variables, which have arisen in the theory of numerical semigroups. We establish their basic properties and find their representation through the power sums…

Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…

Pseudo-variograms appear naturally in the context of multivariate Brown-Resnick processes, and are a useful tool for analysis and prediction of multivariate random fields. We give a necessary and sufficient criterion for a matrix-valued…

Quasisymmetric functions in superspace were introduced as a natural extension of classical quasisymmetric functions involving both commuting and anticommuting variables. In this paper, we first provide a characterization of the algebra of…

We define and study symmetrized and antisymmetrized multivariate exponential functions. They are defined as determinants and antideterminants of matrices whose entries are exponential functions of one variable. These functions are…

Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g. in computation, communication and control. Fully random transformations require exponential time for either classical or quantum…

Here we revisit the quantum algorithms for obtaining Forrelation [Aaronson et al, 2015] values to evaluate some of the well-known cryptographically significant spectra of Boolean functions, namely the Walsh spectrum, the cross-correlation…

We construct a symmetric invertible binary pairing function $F(m,n)$ on the set of positive integers with a property of $F(m,n)=F(n,m)$. Then we provide a complete proof of its symmetry and bijectivity, from which the construction of…

The formula-evaluation problem is defined recursively. A formula's evaluation is the evaluation of a gate, the inputs of which are themselves independent formulas. Despite this pure recursive structure, the problem is combinatorially…

It is shown that harmonic functions from a simply connected domain in R^3 to R^3 cannot always be expressed as a sum of a monogenic (hyperholomorphic) function and an antimonogenic function, in contrast to the situation for complex numbers…