相关论文: Quasirandom Permutations

We study random compositions of transformations having certain uniform fiberwise properties and prove bounds which in combination with other results yield a quenched central limit theorem equipped with a convergence rate, also in the…

We investigate classifications of quasitrivial semigroups defined by certain equivalence relations. The subclass of quasitrivial semigroups that preserve a given total ordering is also investigated. In the special case of finite semigroups,…

A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…

The theory of quasi-arithmetic means is a powerful tool in the study of covariance functions across space-time. In the present study we use quasi-arithmetic functionals to make inferences about the permissibility of averages of functions…

Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a small well-distribution measure. However, they also have some…

Within the Correlated Gaussian Method the parameters of the Gaussian basis functions are often chosen stochastically using pseudo-random sequences. We show that alternative low-discrepancy sequences, also known as quasi-random sequences,…

Dlab and Ringel showed that algebras being quasi-hereditary in all orders for indices of primitive idempotents becomes hereditary. So, we are interested in for which orders a given quasi-hereditary algebra is again quasi-hereditary. As a…

Similar to linear spaces, many examples of quasilinear spaces have a notion of multiplication of the elements. To characterising these examples, in the present paper we generalize the notion of quasilinear spaces and introduce…

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…

We establish a new mixing theorem for quasirandom groups (finite groups with no low-dimensional unitary representations) $G$ which, informally speaking, asserts that if $g, x$ are drawn uniformly at random from $G$, then the quadruple…

Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle…

In this paper, we shall prove that an ultraproduct of non-abelian finite simple groups is either finite simple, or has no finite dimensional unitary representation other than the trivial one. Then we shall generalize this result for other…

A new type of semigroups which appears while dealing with $N=1$ superconformal symmetry in superstring theories is considered. The ideal series having unusual abstract properties is constructed. Various idealisers are introduced and…

A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect matching which is `pseudorandom', meaning that, for instance,…

Model sets play a fundamental role in structure analysis of quasicrystals. The diffraction diagram of a quasicrystal admits as symmetry group a finite group G, and there is a G-cluster C (union of orbits of G) such that the quasicrystal can…

Convolution with an appropriate surface measure on a paraboloid is known to define a bounded operator T from L^p(R^d) to L^q(R^d) for certain exponents p,q. By a quasiextremal for the associated inequality, we mean a function f for which…

We construct minimum-uncertainty states and a non-negative quasi probability distribution for quantum systems on a finite-dimensional space. We reexamine the theorem of Massar and Spindel for the uncertainty relationof the two unitary…

A set of permutations is called sign-balanced if the set contains the same number of even permutations as odd permutations. Let $S_n(\sigma_1, \sigma_2, \ldots, \sigma_r)$ be the set of permutations in the symmetric group $S_n$ which avoids…

We consider quasirandom properties for Cayley graphs of finite abelian groups. We show that having uniform edge-distribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for such Cayley graphs, even if…

We consider the situation when a learner faces a set of unknown discrete distributions $(p_k)_{k\in \mathcal K}$ defined over a common alphabet $\mathcal X$, and can build for each distribution $p_k$ an individual high-probability…