Related papers: Differentially low uniform permutations from known…
The generic structure of 4-point functions of fields residing in indecomposable representations of arbitrary rank is given. The presented algorithm is illustrated with some non-trivial examples and permutation symmetries are exploited to…
Functions with low $c$-differential uniformity were proposed in $2020$ and attracted lots of attention, especially the P$c$N and AP$c$N functions, due to their applications in cryptography. The objective of this paper is to study P$c$N and…
Recently, low-resolution LDPC decoders have been introduced that perform mutual information maximizing signal processing. However, the optimal quantization in variable and check nodes requires expensive non-uniform operations. Instead, we…
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…
By exploiting the property that the RBM log-likelihood function is the difference of convex functions, we formulate a stochastic variant of the difference of convex functions (DC) programming to minimize the negative log-likelihood.…
In this paper we construct directionally sensitive functions that can be viewed as directional time-frequency representations. We call such a sequence a rotational uniform covering frame and by studying rotations of the frame, we derive the…
It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear codes. Such results in the lattice-based setting have been carried out using number fields: Polynomial-LWE,…
The aim of this paper is to give a new proof that any very weak $s$-harmonic function $u$ in the unit ball $B$ is smooth. As a first step, we improve the local summability properties of $u$. Then, we exploit a suitable version of the…
We derive a new upper bound on the reliability function for channel coding over discrete memoryless channels. Our bounding technique relies on two main elements: (i) adding an auxiliary genie-receiver that reveals to the original receiver a…
In this paper we show discrepancy bounds for index-transformed uniformly distributed sequences. From a general result we deduce very tight lower and upper bounds on the discrepancy of index-transformed van der Corput-, Halton-, and…
We present novel homomorphic encryption schemes for integer arithmetic, intended for use in secure single-party computation in the cloud. These schemes are capable of securely computing only low degree polynomials homomorphically, but this…
We construct the partition function of 1/8 BPS dyons in type II string theory on T^6 from counting of microstates of a D1-D5 system in Taub-NUT space. Our analysis extends the earlier ones by Shih, Strominger and Yin and by Pioline by…
Unsupervised pre-training is a common step in developing computer vision models and large language models. In this setting, the absence of labels requires the use of similarity-based loss functions, such as contrastive loss, that favor…
We establish a general weak* lower semicontinuity result in the space $\BD(\Omega)$ of functions of bounded deformation for functionals of the form $$\Fcal(u) := \int_\Omega f \bigl(x, \Ecal u \bigr) \dd x + \int_\Omega f^\infty \Bigl(x,…
Spectral functions of symmetric matrices -- those depending on matrices only through their eigenvalues -- appear often in optimization. A cornerstone variational analytic tool for studying such functions is a formula relating their…
Many learning problems require uncovering a hidden ordering that reveals structure in unordered data, such as monotonicity in sorting or spatial continuity in jigsaw reconstruction. In these settings, permutations can be learned as latent…
We introduce a new methodology for modeling regular spatial data using hyperuniform point processes. We show that, under some mixing conditions on the perturbations, perturbed lattices in general dimension are hyperuniform. Due to their…
We introduce a natural generalization of the golden cryptography, which uses general unimodular matrices in place of the traditional Q-matrices, and prove that it preserves the original error correction properties of the encryption.…
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…
We propose a new symmetric cryptographic scheme based on functional invariants defined over discrete oscillatory functions with hidden parameters. The scheme encodes a secret integer through a four-point algebraic identity preserved under…