Related papers: Quasirandomness in additive groups and hypergraphs
Fusion is defined for arbitrary lowest weight representations of $W$-algebras, without assuming rationality. Explicit algorithms are given. A category of quasirational representations is defined and shown to be stable under fusion.…
A random group contains many quasiconvex surface subgroups.
Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to k-uniform hypergraphs, but only for…
In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…
Objects that are on the verge of being extremal black holes but actually are distinct in many ways are called quasi-black holes. Quasi-black holes are defined here and treated in a unified way through the displaying of their properties. The…
A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…
I discuss a special class of singularities obtained as a natural 4-dimensional generalization of the conical singularity. Such singularities (called quasiregular) are ruinous for the predictive force of general relativity, so one often…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is 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…
Let $G$ be a finite group acting transitively on a set $\Omega$. We study what it means for this action to be {\it quasirandom}, thereby generalizing Gowers' study of quasirandomness in groups. We connect this notion of quasirandomness to…
We consider special multiclass spectral, discrepancy, degree, and codegree properties of expanding graph sequences. As we can prove equivalences and implications between them and the definition of the generalized quasirandomness of…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
Motivated by intuitive properties of physical quantities, the notion of a non-anomalous semigroup is formulated. These are totally ordered semigroups where there are no `infinitesimally close' elements. The real numbers are then defined as…
We apply a framework for the description of random tilings without height representation, which was proposed recently, to the special case of quasicrystalline random tilings. Several important examples are discussed, thereby demonstrating…
The paper presents mathematical models of quasicrystals with particular attention given to cut-and-project sets. We summarize the properties of higher-dimensional quasicrystal models and then focus on the one-dimensional ones. For the…
Quasifolds are singular spaces that generalize manifolds and orbifolds. They are locally modeled by manifolds modulo the smooth action of countable groups and they are typically not Hausdorff. If the countable groups happen to be all…
We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either…
We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine…
A finite group $G$ is called $C$-quasirandom (by Gowers) if all non-trivial irreducible complex representations of $G$ have dimension at least $C$. For any unit $\ell^{2}$ function on a finite group we associate the quantum probability…
We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…