相关论文: $C$-differentials, multiplicative uniformity and (…
We give a proof of universality in the bulk of spectrum of unitary matrix models, assuming that the potential is globally $C^{2}$ and locally $C^{3}$ function. The proof is based on the determinant formulas for correlation functions in…
The goal of the present paper is to introduce and study noncommutative Hardy spaces associated with the regular $\Lambda$-polyball, to develop a functional calculus on noncommutative Hardy spaces for the completely non-coisometric (c.n.c.)…
The incomplete version of the Macdonald function has various appellations in literature and earns a well-deserved reputation of being a computational challenge. This paper ties together the previously disjoint literature and presents the…
We discuss the second-order differential uniformity of vectorial Boolean functions. The closely related notion of second-order zero differential uniformity has recently been studied in connection to resistance to the boomerang attack. We…
In this paper we obtain several new complete characterizations of pseudolinear functions. Two of the results are of first-order and one is derivative free. All results are derived in terms of the Clarke-Rockafellar subdifferential.…
This paper is concerned with the spectral characteristics of quaternionic positive definite functions on the real line. We generalize the Stone's theorem to the case of a right quaternionic linear one-parameter unitary group via two…
Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…
A block cipher is intended to be computationally indistinguishable from a random permutation of appropriate domain and range. But what are the properties of a random permutation? By the aid of exponential and ordinary generating functions,…
We study superdense coding with uniformly accelerated particle in single mode approximation and beyond single mode approximation. We use four different functions, the capacity of superdense coding, negativity, discord and the probability of…
The trace anomaly of conformal field theories in four dimensions is characterized by '$a$' and '$c$'-functions. The scaling properties of the effective action of a CFT in the presence of boundaries is shown to be determined by $a$, $c$ and…
The Walsh transform $\widehat{Q}$ of a quadratic function $Q:F_{p^n}\rightarrow F_p$ satisfies $|\widehat{Q}(b)| \in \{0,p^{\frac{n+s}{2}}\}$ for all $b\in F_{p^n}$, where $0\le s\le n-1$ is an integer depending on $Q$. In this article, we…
For a domain $\Omega\subset\mathbb R^n$, we introduce the concept of a uniformly $C^m$ defining function. We characterize uniformly $C^m$ defining functions in terms of the signed distance function for the boundary and provide a large class…
Given a rigid C*-tensor category C with simple unit and a probability measure $\mu$ on the set of isomorphism classes of its simple objects, we define the Poisson boundary of $(C,\mu)$. This is a new C*-tensor category P, generally with…
Given a function on diagonal matrices, there is a unique way to extend this to an invariant (by conjugation) function on symmetric matrices. We show that the extension preserves regularity -- that is, if the original function is k times…
We determine a connection between the weight of a Boolean function and the total weight of its first-order derivatives. The relationship established is used to study some cryptographic properties of Boolean functions. We establish a…
Vectorial Boolean functions are crucial building-blocks in symmetric ciphers. Different known attacks on block ciphers have resulted in diverse cryptographic criteria for vectorial Boolean functions, such as differential uniformity and…
Recently, Beierle and Leander found two new sporadic quadratic APN permutations in dimension 9. Up to EA-equivalence, we present a single trivariate representation of those two permutations as $C_u \colon (\mathbb{F}_{2^m})^3 \rightarrow…
We obtain a uniform stability of recovering entire functions of a special form from their zeros. To this form, one can reduce the characteristic determinants of strongly regular differential operators and pencils of the first and the second…
The complexity of continuous piecewise affine (CPA) functions can be measured by the number of pieces $p$ or the number of distinct affine functions $n$. For CPA functions on $\mathbb{R}^d$, this paper shows an upper bound of $p=O(n^{d+1})$…
Characterizing the privacy degradation over compositions, i.e., privacy accounting, is a fundamental topic in differential privacy (DP) with many applications to differentially private machine learning and federated learning. We propose a…