Related papers: Quasirandomness in additive groups and hypergraphs
We clarify the significance of quasiprobability (QP) in quantum mechanics that is relevant in describing physical quantities associated with a transition process. Our basic quantity is Aharonov's weak value, from which the QP can be defined…
We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…
Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore…
A factor-graph representation of quantum-mechanical probabilities (involving any number of measurements) is proposed. Unlike standard statistical models, the proposed representation uses auxiliary variables (state variables) that are not…
The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…
Quasi-isometry is a measure of how similar two graphs are at `large-scale'. Nguyen, Scott, and Seymour [arXiv:2501.09839] and Hickingbotham [arXiv:2501.10840] independently gave a characterisation of graphs quasi-isometric to graphs of…
We obtain a criterion for quasiconvexity of a subgroup of an amalgamated free product of two word hyperbolic groups along a virtually cyclic subgroup. The result provides a method of constructing new word hyperbolic group in class (Q), that…
To each colored graph, one can associate its closure in the universal space of isomorphism classes of pointed colored graphs, and this subspace can be regarded as a generalized subshift. Based on this correspondence, we extend the notion of…
Universality of quantum mechanics -- its applicability to physical systems of quite different nature and scales -- indicates that quantum behavior can be a manifestation of general mathematical properties of systems containing…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
The concept of typicality refers to properties holding for the "overwhelming majority" of cases and is a fundamental idea of the qualitative approach to dynamical problems. We argue that measure-theoretical typicality would be the adequate…
A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a…
Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness--recently proved to be theoretically incomputable--and some well-known computable sources of pseudo-randomness. Incomputability is a…
We present a one-parameter family of models for square contingency tables that interpolates between the classical quasisymmetry model and its Pearsonian analogue. Algebraically, this corresponds to deformations of toric ideals associated…
This paper finds a symmetry relation (between quantiles of a random variable and its negative) that is intuitively appealing. We show this symmetry is quite useful in finding new relations for quantiles, in particular an equivariance…
Randomness is viewed through an analogy between a physical quantity, density of gas, and a mathematical construct -- probability density. Boltzmann's deduction of equilibrium distribution of ideal gas placed in an external potential field…
In this paper it is proved that relative hyperbolicity is an invariant of quasi-isometry. As a byproduct of the arguments, simplified definitions of relative hyperbolicity are obtained. In particular we obtain a new definition very similar…
In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable…
This article examines the subtle relationship between chaos and randomness, two concepts that, although they refer to seemingly unpredictable phenomenon, are based on fundamentally different principles. Chaos manifests in deterministic…
Here we introduce simple structures for the analysis of complex hypergraphs, hypergraph animals. These structures are designed to describe the local node neighbourhoods of nodes in hypergraphs. We establish their relationships to lattice…