Related papers: Shift-invariant transformations and almost lifting…

It has been found empirically that quasi-Monte Carlo methods are often efficient for very high-dimensional problems, that is, with dimension in the hundreds or even thousands. The common explanation for this surprising fact is that those…

Progress along the line of a previous article are reported. One main point is to include chiral operators with fractional quantum group spins (fourth or sixth of integers) which are needed to achieve modular invariance. We extend the study…

The maximum function, on vectors of real numbers, is not differentiable. Consequently, several differentiable approximations of this function are popular substitutes. We survey three smooth functions which approximate the maximum function…

Motivated by Stanley's conjecture on the multiplication of Jack symmetric functions, we prove a couple of identities showing that skew Jack symmetric functions are semi-invariant up to translation and rotation of a $\pi$ angle of the skew…

The notion of o-polynomial comes from finite projective geometry. In 2011 and later, it has been shown that those objects play an important role in symmetric cryptography and coding theory to design bent Boolean functions, bent vectorial…

We define a two-parameter deformation of the quasi-shuffle by means of the formal group law associated with the exponential generating function of the homogeneous Eulerian polynomials, and construct bases of $QSym$ and $\WQSym$ whose…

Conic quasi-linear maps are nonlinear operators from $C_0(X)$ to a normed linear space $E$ which preserve nonnegative linear combinations on positive cones generated by single functions; quasi-linear maps are linear on singly generated…

A new multiplication-free transform derived from DHT is introduced: the RHT. Investigations on the properties of the RHT led us to the concept of weak-inversion. Using new constructs, we show that RHT is not involutional like the DHT, but…

A fundamental problem in manifold learning is to approximate a functional relationship in a data chosen randomly from a probability distribution supported on a low dimensional sub-manifold of a high dimensional ambient Euclidean space. The…

We prove that, to compute a Boolean function $f$ on $N$ variables with error probability $\epsilon$, any quantum black-box algorithm has to query at least $\frac{1 - 2\sqrt{\epsilon}}{2} \rho_f N = \frac{1 - 2\sqrt{\epsilon}}{2} \bar{S}_f$…

We define a switch function to be a function from an interval to $\{1,-1\}$ with a finite number of sign changes. (Special cases are the Walsh functions.) By a topological argument, we prove that, given $n$ real-valued functions, $f_1,…

We study the approximation of functions which are invariant with respect to certain permutations of the input indices using flow maps of dynamical systems. Such invariant functions includes the much studied translation-invariant ones…

In this paper a new class of radial basis functions based on hyperbolic trigonometric functions will be introduced and studied. We focus on the properties of their generalised Fourier transforms with asymptotics. Therefore we will compute…

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…

In this note, we go further on the "basis exchange" idea presented in \cite{LiNa1} by using Mobious inversion. We show that the matrix $S_1(f)S_0(f)^{-1}$ has a nice form when $f$ is chosen to be the majority function, where $S_1(f)$ is the…

The $\epsilon$-approximate degree $deg_\epsilon(f)$ of a Boolean function $f$ is the least degree of a real-valued polynomial that approximates $f$ pointwise to error $\epsilon$. The approximate degree of $f$ is at least $k$ iff there…

Let $(X, \sigma_X), (Y, \sigma_Y)$ be one-sided subshifts with the specification property and $\pi:X\rightarrow Y$ a factor map. Let $\mu$ be a unique invariant Gibbs measure for a sequence of continuous functions $\F=\{\log…

In this paper, we study the value distributions of perfect nonlinear functions, i.e., we investigate the sizes of image and preimage sets. Using purely combinatorial tools, we develop a framework that deals with perfect nonlinear functions…

A record in a permutation is a maximum or a minimum, from the left or from the right. The entries of a permutation can be partitioned into two types: the ones that are records are called external points, the others are called internal…

In this paper, we unify and improve existing results on characterizing strict and almost stricty convex functions via subdifferential mapping, Moreau envelope, and proximal mappings. In particular, it is shown that if a convex function is…