相关论文: A sharp threshold for collapse of the random trian…

Let $G$ be a compact Lie group, $N\geq 1$ and $L>0$. The random geometric graph on $G$ is the random graph $\Gamma(N,L)$ whose vertices are $N$ random points $g_1,\ldots,g_N$ chosen under the Haar measure of $G$, and whose edges are the…

Let $\omega_0, \omega_1,\ldots, \omega_n$ be a full set of outcomes (letters, symbols) and let positive $p_i$, $i=0,\ldots,n$, be their probabilities ($\sum_{i=0}^n p_i=1$). Let us treat $\omega_0$ as a stop symbol; it can occur in…

This note describes the first example of a group that is amenable, but cannot be obtained by subgroups, quotients, extensions and direct limits from the class of groups locally of subexponential growth. It has a balanced presentation…

In this paper, we introduce a new family of graphs, $\Gamma(n,a)$. We show that it is an infinite family of tetravalent half-transitive Cayley graphs. Apart from that, we determine some structural properties of $\Gamma(n,a)$.

Let $\Gamma$ be a countable discrete group, $H$ a lcsc totally disconnected group and $\rho : \Gamma \rightarrow H$ a homomorphism with dense image. We develop a general and explicit technique which provides, for every compact open subgroup…

We consider the problem of robust polynomial regression, where one receives samples $(x_i, y_i)$ that are usually within $\sigma$ of a polynomial $y = p(x)$, but have a $\rho$ chance of being arbitrary adversarial outliers. Previously, it…

To consider a high-dimensional random process, we propose a notion about stochastic tensor-valued random process (TRP). In this work, we first attempt to apply a generic chaining method to derive tail bounds for all p-th moments of the…

Motivated by Freyd's famous unsolved problem in stable homotopy theory, the generating hypothesis for the stable module category of a finite group is the statement that if a map in the thick subcategory generated by the trivial…

Let $k$ be a field of arbitrary characteristic, $A$ be a domain and $K=\mathrm{frac}(A)$. Then (1) All exponential maps of $k^{[3]}$ are rigid, and we give a necessary and sufficient condition for the triangularity of $\delta \in…

We give a short proof that the largest component of the random graph $G(n, 1/n)$ is of size approximately $n^{2/3}$. The proof gives explicit bounds for the probability that the ratio is very large or very small.

Gems are a particular type of edge-colored graphs, dual to colored triangulations, which represent compact PL-manifolds of arbitrary dimension, both in the closed and boundary case. In the present paper, gem theory is used to approach…

Let $\Gamma$ be a finitely presented group and $G$ a linear algebraic group over $\mathbb{R}$. A representation $\rho:\Gamma\rightarrow G(\mathbb{R})$ can be seen as an $\mathbb{R}$-point of the representation variety $\mathfrak{R}(\Gamma,…

We show that every finitely generated cohomologically trivial module over $RG$, where $G$ is a finite $p$-group and $R$ is a $p$-adic ring, splits as the direct sum of a finite cohomologically trivial $RG$-module and a free $RG$-module.…

Emergence of dominating cliques in Erd\"os-R\'enyi random graph model ${\bbbg(n,p)}$ is investigated in this paper. It is shown this phenomenon possesses a phase transition. Namely, we have argued that, given a constant probability $p$, an…

Given any finitely presented group G we find a triangular algebra such that has two presentations, one with fundamental group G and another with trivial group. Thus proving that given a collection G1,...,Gn of finitely presented groups…

We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…

Consider the Cayley graph of $S_n$ generated by a random pair of elements $x,y$. Conjecturally, the girth of this graph is $\Omega(n \log n)$ with probability tending to $1$ as $n\to\infty$. We show that it is at least $\Omega(n^{1/3})$.

We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

We give simple arithmetic conditions that force the Sylow $p$-subgroup of the critical group of a strongly regular graph to take a specific form. These conditions depend only on the parameters $(v, k, \lambda, \mu)$ of the strongly regular…