相关论文: Virtual Geometricity is Rare
The geometric monodromy of a plane curve singularity is a quasi-finite diffeomorphism. In this paper we locate the reduction curves of the geometric monodromy and the quadratic vanishing cycles of the singularity. An application to the…
We introduce and simulate a two dimensional probabilistic model of granular matter at vanishing pressure. The model exhibits a perfectly sharp random loose packing density, a phenomenon that should be verifiable for real granular matter.
We prove that if $G$ is a finitely generated RFRS group of cohomological dimension $2$, then $G$ is virtually free-by-cyclic if and only if $b_2^{(2)}(G) = 0$. This answers a question of Wise and generalises and gives a new proof of a…
Word maps provide a wealth of information about finite groups. We examine the connection between the probability distribution induced by a word map and the underlying structure of a finite group. We show that a finite group is nilpotent if…
We prove ergodicity of unitary random-matrix theories by showing that the autocorrelation function with respect to energy or magnetic field strength of any observable vanishes asymptotically. We do so using Efetov's supersymmetry method, a…
In this article, we study geometric properties of nilpotent groups. We find a geometric criterion for the word problem for the finitely generated free nilpotent groups. By geometric criterion, we mean a way to determine whether two words…
It has been recently claimed [arXiv:1102.3434] that quantum gravity models where the number of dimensions reduces at the ultraviolet exhibit a potentially observable cutoff in the primordial gravitational wave spectrum, and that this is a…
Let $S(\infty)$ denote the infinite symmetric group formed by the finitary permutations of the set of natural numbers; this is a countable group. We introduce its virtual group algebra, a completion of the conventional group algebra…
We give a bound for the geometric dimension for the family of virtually cyclic groups in mapping class groups of a compact surface with punctures, possibly with nonempty boundary and negative Euler characteristic.
Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of sampled points with probability that depends on their distance,…
Recent work of Brlek \textit{et al.} gives a characterization of digitally convex polyominoes using combinatorics on words. From this work, we derive a combinatorial symbolic description of digitally convex polyominoes and use it to analyze…
We study the probability that certain laws are satisfied on infinite groups, focusing on elements sampled by random walks. For several group laws, including the metabelian one, we construct examples of infinite groups for which the law…
We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…
An integer partition is called graphical if it is the degree sequence of a simple graph. We prove that the probability that a uniformly chosen partition of size $n$ is graphical decreases to zero faster than $n^{-.003}$, answering a…
Let X be an irreducible complex affine algebraic variety defined over $\mathbb{R}$, equipped with a faithful action of a finite group G, and let Y = X // G denote the categorical quotient with projection $\pi$. We study the geometry of the…
We are interested in constructing concrete independent events in purely atomic probability spaces with geometric distribution. Among other facts we prove that there are uncountable many sequences of independent events.
Detecting the dimensionality of graphs is a central topic in machine learning. While the problem has been tackled empirically as well as theoretically, existing methods have several drawbacks. On the one hand, empirical tools are…
We consider reshaping a scattering obstacle virtually by using transformation optics in acoustic and electromagnetic scattering. Among the general virtual reshaping results, the virtual minification and virtual magnification are…
Many machine learning algorithms used for dimensional reduction and manifold learning leverage on the computation of the nearest neighbours to each point of a dataset to perform their tasks. These proximity relations define a so-called…
We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted. We assume that the transition…