Related papers: Quasirandomness in additive groups and hypergraphs

We present a natural extension of the process of taking a group quotient to arbitrary subgroups. We first review basic concepts from group theory. This will allow us to see the relationship between our new, more general quotient operation…

A quasisymmetric graph is a curve whose projection onto a line is a quasisymmetric map. We show that this class of curves is related to solutions of the reduced Beltrami equation and to a generalization of the Zygmund class $\Lambda_*$.…

Gowers has elegantly characterized the finite groups $G$ in which $A_1A_2A_3 = G$ for any positive density subsets $A_1,A_2,A_3$. This property, quasi-randomness, holds if and only if G does not admit a nontrivial irreducible representation…

We discuss the (re-)construction of quasiprobability representations from generic measurements, including noisy ones. Based on the measurement under study, quasiprobabilities and the associated concept of nonclassicality are introduced. A…

Quasi-random walks show similar features as standard random walks, but with much less randomness. We utilize this established model from discrete mathematics and show how agents carrying out quasi-random walks can be used for image…

The main result of this paper states that for any group $G$ with an automatic structure $L$ with unique representatives one can construct a uniform partial algorithm which detects $L$-rational subgroups and gives their preimages in $L$.…

A random vector whose norm and overlap (inner product with an independent copy) concentrates is shown to have random low-dimensional projections that are approximately random Gaussians. Conversely, asymptotically random Gaussian projections…

Let G be a group which is hyperbolic relative to a collection of subgroups A, and it is also hyperbolic relative to a collection of subgroups B. Suppose that the collection A contains B. We characterize, for subgroups of G, when…

We prove that triangular configurations are plentiful in large subsets of cartesian squares of finite quasirandom groups from classes having the quasirandom ultraproduct property, for example the class of finite simple groups. This is…

The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…

Compound distributions allow construction of a rich set of distributions. Typically they involve an intractable integral. Here we use a quadrature approximation to that integral to define the quadrature compound family. Special care is…

For every fixed graph $H$ and every fixed $0 < \alpha < 1$, we show that if a graph $G$ has the property that all subsets of size $\alpha n$ contain the ``correct'' number of copies of $H$ one would expect to find in the random graph…

A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. We prove that every infinite family of nontrivial strongly regular graphs is quasi-random in the sense of Chung, Graham and Wilson.

Random shapes arise naturally in many contexts. The topological and geometric structure of such objects is interesting for its own sake, and also for applications. In physics, for example, such objects arise naturally in quantum gravity, in…

Pseudorandmness plays an important role in number theory, complexity theory and cryptography. Our aim is to use models of arithmetic to explain pseudorandomness by randomness. To this end we construct a set of models $\cal M$, a common…

The inverse problem of general rough sets, considered by the present author in some of her earlier papers, in one of its manifestations is essentially the question of when an agent's view about crisp and non crisp objects over a set of…

Quasi-set theory is a first order theory without identity, which allows us to cope with non-individuals in a sense. A weaker equivalence relation called ``indistinguishability'' is an extension of identity in the sense that if $x$ is…

A group, defined as set with associative multiplication and inverse, is a natural structure describing the symmetry of a space. The concept of group generalizes to group objects internal to other categories than sets. But there are yet more…

Quasinormal modes describe the ringdown of compact objects deformed by small perturbations. In generic theories of gravity that extend General Relativity, the linearized dynamics of these perturbations is described by a system of coupled…

Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…