相关论文: Limit shapes for growing extreme characters of $U(…

Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…

Expanding products of invariant functions of a group element as a series in the basis of characters of the irreducible representations of a group is widely used in many areas of physics and related fields. In this contribution a formula to…

Let $U$ be a maximal unipotent subgroup in a symplectic group over a finite field of sufficiently large characteristic $p$. According to the Kirillov's orbit method, the coadjoint orbits of the group $U$ play the key role in the description…

We investigate an extremal dynamics model of evolution with a variable number of units. Due to addition and removal of the units, the topology of the network evolves and the network splits into several clusters. The activity is mostly…

Let $q$ be a prime power and $U$ the group of lower unitriangular matrices of order $n$ for some natural number $n$. We give a lower bound for the degrees of irreducible constituents of Andr\'{e}-Yan supercharacters and classify the…

We consider the Norros-Reittu random graph $NR_n(\textbf{w})$, where edges are present independently but edge probabilities are moderated by vertex weights, and use probabilistic arguments based on martingales to analyse the component sizes…

This note constructs a finitely generated group $W$ whose word-growth is exponential, but for which the infimum of the growth rates over all finite generating sets is 1 -- in other words, of non-uniformly exponential growth. This answers a…

This paper develops new limit theory for data that are generated by networks or more generally display cross-sectional dependence structures that are governed by observable and unobservable characteristics. Strategic network formation…

In this note we give a new effective proof method for the equivalence of the notions of testability and nondeterministic testability for uniform hypergraph parameters. We provide the first effective upper bound on the sample complexity of…

We develop the concept of character level for the complex irreducible characters of finite, general or special, linear and unitary groups. We give characterizations of the level of a character in terms of its Lusztig's label and in terms of…

Random growth models are fundamental objects in modern probability theory, have given rise to new mathematics, and have numerous applications, including tumor growth and fluid flow in porous media. In this article, we introduce some of the…

For a Markov process associated with a diffusion type Dirichlet form an upper bound is shown for the law of the finite dimensional distributions of the process. Under some more assumptions on the underlaying space this is also shown for the…

In this work, we study the problem of finding the asymptotic growth rate of the number of of $d$-dimensional arrays with side length $n$ over a given alphabet which avoid a list of one-dimensional "forbidden" words along all cardinal…

We study the length of cycles in the model of spatial random permutations in Euclidean space. In this model, for given length $L$, density $\rho$, dimension $d$ and jump density $\varphi$, one samples $\rho L^d$ particles in a…

The maximal subgroup of unipotent upper-triangular matrices of the finite general linear groups are a fundamental family of $p$-groups. Their representation theory is well-known to be wild, but there is a standard supercharacter theory,…

We consider relative character varieties on $\mathbb{P}^1\backslash\{0,1,\infty\}$ with $G=GL(r), O(r)$, or $Sp(r)$. Using a diagrammatic method of Simpson's, we give an explicit linear upper bound $R(d)$ on the rank $r$ of an MC-minimal…

In this work, we treat subshifts, defined in terms of an alphabet $A$ and (usually infinite) forbidden list $F$, where the number of $n$-letter words in $F$ has "slow growth rate" in $n$. We show that such subshifts are well-behaved in…

Given a random word of size $n$ whose letters are drawn independently from an ordered alphabet of size $m$, the fluctuations of the shape of the random RSK Young tableaux are investigated, when $n$ and $m$ converge together to infinity. If…

We define and study supercharacters of the classical finite unipotent groups of symplectic and orthogonal types (over any finite field of odd characteristic). We show how supercharacters for groups of those types can be obtained by…

We give lower bounds on the maximum possible girth of an $r$-uniform, $d$-regular hypergraph with at most $n$ vertices, using the definition of a hypergraph cycle due to Berge. These differ from the trivial upper bound by an absolute…