Related papers: Quasirandomness in additive groups and hypergraphs
We investigate the use of quasicrystals in image sampling. Quasicrystals produce space-filling, non-periodic point sets that are uniformly discrete and relatively dense, thereby ensuring the sample sites are evenly spread out throughout the…
We study incidence geometries that are thin and residually connected. These geometries generalise abstract polytopes. In this generalised setting, guided by the ideas from the polytopes theory, we introduce the concept of chirality, a…
We provide a new and elegant approach to relative quasiconvexity for relatively hyperbolic groups in the context of Bowditch's approach to relative hyperbolicity using cocompact actions on fine hyperbolic graphs. Our approach to…
The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
A notion of general manifolds is introduced. It covers all usual manifolds in mathematics. Essentially, it is a way how to get a bigger 'fibration' over a site which locally coincides with a given one. An enrichment with generalized…
We call an affine algebraic supergroup quasireductive if its underlying algebraic group is reductive. We obtain some results about the structure and representations of reductive supergroups.
Moments of secular and inverse secular coefficients, averaged over random matrices from classical groups, are related to the enumeration of non-negative matrices with prescribed row and column sums. Similar random matrix averages are…
We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g. in computation, communication and control. Fully random transformations require exponential time for either classical or quantum…
An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…
We study emerging notions of quantum correlations in compound systems. Based on different definitions of quantumness in individual subsystems, we investigate how they extend to the joint description of a composite system. Especially, we…
A word is quasiperiodic (or coverable) if it can be covered with occurrences of another finite word, called its quasiperiod. A word is multi-scale quasiperiodic (or multi-scale coverable) if it has infinitely many different quasiperiods.…
Using the technique of quasi difference sets we characterize geometry and automorphisms of configurations which can be presented as a join of some others, in particular - which can be presented as series of cyclically inscribed copies of…
Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries are in a general form that captures a wide range of…
Our goal is to provide a survey of some topics in quasiconformal analysis of current interest. We try to emphasize ideas and leave proofs and technicalities aside. Several easily stated open problems are given. Most of the results are joint…
A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…
Randomness is a crucial resource for a broad range of important applications, such as Monte Carlo simulation and computation, generative artificial intelligence and cryptography. But what is randomness? A widely accepted definition has…
We characterize probabilities in Bayesian networks in terms of algebraic expressions called quasi-probabilities. These are arrived at by casting Bayesian networks as noisy AND-OR-NOT networks, and viewing the subnetworks that lead to a node…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…