Related papers: Quasirandom Arithmetic Permutations
We define algebras of quasi-quaternion type, which are symmetric algebras of tame representation type whose stable module category has certain structure similar to that of the algebras of quaternion type introduced by Erdmann. We observe…
We address the question as to why, in the semiclassical limit, classically chaotic systems generically exhibit universal quantum spectral statistics coincident with those of Random Matrix Theory. To do so, we use a semiclassical resummation…
We present a general theory of quasiparticle number fluctuations in superconductors. The theory uses the master equation formalism. First, we develop the theory for a single occupation variable. Although this simple system is insufficient…
We construct an explicit Hopf algebra isomorphism from the algebra of heap-ordered trees to that of quasi-symmetric functions, generated by formal permutations, which is a lift of the natural projection of the Connes-Kreimer algebra of…
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…
The study of substructures in random objects has a long history, beginning with Erd\H{o}s and R\'enyi's work on subgraphs of random graphs. We study the existence of certain substructures in random subsets of vector spaces over finite…
The random permutation is the Fra\"iss\'e limit of the class of finite structures with two linear orders. Answering a problem stated by Peter Cameron in 2002, we use a recent Ramsey-theoretic technique to show that there exist precisely 39…
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 study the spectral statistics for quantized skew translations on the torus, which are ergodic but not mixing for irrational parameters. It is shown explicitly that in this case the level--spacing distribution and other common spectral…
We study the interplay between notions of quasirandomness for additive sets and for hypergraphs. In particular, we show a strong connection between the notions of Gowers uniformity in the additive setting and discrepancy-type measures of…
By modeling quantum chaotic dynamics with ensembles of random operators, we explore howmachine learning learning algorithms can be used to detect pseudorandom behavior in qubit systems.We analyze samples consisting of pieces of correlation…
We study quasiperiodically forced circle endomorphisms, homotopic to the identity, and show that under suitable conditions these exhibit uncountably many minimal sets with a complicated structure, to which we refer to as `strangely…
In this paper, we introduce the notion of quaternion shearlet transform- which is an extension of the ordinary shearlet transform. Firstly, we study the fundamental properties of quaternion shearlet transforms and then establish some basic…
We discuss some classical and recent results and open problems on the statistical behavior of ergodic sums above toral translations, and their applications to Diophantine approximations and to ergodic properties of systems related to…
We introduce the notion of numerical semigroups generated by concatenation of arithmetic sequences and show that this class of numerical semigroups exhibit multiple interesting behaviours.
We define a notion of a rotund quasi-uniform space and describe a new direct construction of a (right-continuous) quasi-pseudometric on a (rotund) quasi-uniform space. This new construction allows to give alternative proofs of several…
We propose a general formalism of iterated random functions with semigroup property, under which exact and approximate Bayesian posterior updates can be viewed as specific instances. A convergence theory for iterated random functions is…
We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and…
In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave…
The paper provides a simpler method for proving a delicate inequality that was used by Achlioptis and Naor to establish asymptotic concentration for chromatic numbers of Erdos-Renyi random graphs. The simplifications come from two new…