相关论文: $4$-uniform BCT permutations from generalized butt…

This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…

Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a…

Permutons are probability measures on the unit square with uniform marginals that provide a natural way to describe limits of permutations. We are interested in the permuton limits for permutations sampled uniformly from certain…

The concept of differential uniformity was recently extended to the $c$-differential uniformity. An interesting problem in this area is the construction of functions with low $c$-differential uniformity and a lot of research has been done…

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular,…

Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding internal BSTs into the nodes of an external BST -- a structure…

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…

The general structure of the conformal anomaly and the dilaton's effect to it are analysed. First we give a new formal proof of the statement that the conformal anomaly, in the theory which is conformal invariant at the classical level, is…

The theory of regular variation, in its Karamata and Bojani\'c-Karamata/de Haan forms, is long established and makes essential use of homomorphisms. Both forms are subsumed within the recent theory of Beurling regular variation, developed…

Due to implementation constraints the XOR operation is widely used in order to combine plaintext and key bit-strings in secret-key block ciphers. This choice directly induces the classical version of the differential attack by the use of…

We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

Fast linear transforms are ubiquitous in machine learning, including the discrete Fourier transform, discrete cosine transform, and other structured transformations such as convolutions. All of these transforms can be represented by dense…

Substitution boxes (S-boxes) play a significant role in ensuring the resistance of block ciphers against various attacks. The Upper Boomerang Connectivity Table (UBCT), the Lower Boomerang Connectivity Table (LBCT) and the Double Boomerang…

The direct string computation of anomalous D-brane and orientifold plane couplings is extended to include the curvature of the normal bundle. The normalization of these terms is fixed unambiguously. New, non-anomalous gravitational…

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…

We study a class of newly-introduced CFTs associated with even quadratic forms of general signature, which we call generalized Narain theories. We first summarize the properties of these theories. We then consider orbifolds of these…

We present some Markovian approaches to prove universality results for some functions on the symmetric group. Some of those statistics are already studied in [Kammoun, 2018, 2020] but not the general case. We prove, in particular, that the…