相关论文: Asymptotic Approximate Fekete Arrays

Generalizing the dihedral picture for G(M,M,2), we construct Hecke algebras (and present a strategy for constructing Hecke categories) and asymptotic counterparts. We think of these as associated with the complex reflection group G(M,M,N).

We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…

The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…

The Pitman sampling formula has been intensively studied as a distribution of random partitions. One of the objects of interest is the length $K (= K_{n,\theta,\alpha})$ of a random partition that follows the Pitman sampling formula, where…

We introduce dynamic asymptotic dimension, a notion of dimension for actions of discrete groups on locally compact spaces, and more generally for locally compact \'etale groupoids. We study our notion for minimal actions of the integer…

Fekete's lemma is a well known result from combinatorial mathematics that shows the existence of a limit value related to super- and subadditive sequences of real numbers. In this paper, we analyze Fekete's lemma in view of the arithmetical…

We prove various estimates for the asymptotics of counting functions associated to point sets of coherent frames and Riesz sequences. The obtained results recover the necessary density conditions for coherent frames and Riesz sequences for…

The classical Ramsey theorem, states that every graph contains either a large clique or a large independent set. Here we investigate similar dichotomic phenomena in the context of finite metric spaces. Namely, we prove statements of the…

Our previous paper applied a lopsided version of the Lov\'asz Local Lemma that allows negative dependency graphs to the space of random injections from an $m$-element set to an $n$-element set. Equivalently, the same story can be told about…

Let $\mathcal{F}=\{A_1,A_2,\ldots,A_k\}$ be a collection of finite arithmetic progressions, where each $A_d$ is an initial segment of the set $D_d=\{d,2d,3d,\ldots\}$ of consecutive multiples of a positive integer $d$. Let $m(\mathcal{F})$…

We apply the recent results of F. Hiai, M. Mosonyi and T. Ogawa [arXiv:0707.2020, to appear in J. Math. Phys.] to the asymptotic hypothesis testing problem of locally faithful shift-invariant quasi-free states on a CAR algebra. We use a…

Asymptotic optimality is a key theoretical property in model averaging. Due to technical difficulties, existing studies rely on restricted weight sets or the assumption that there is no true model with fixed dimensions in the candidate set.…

Many asymptotic formulas exist for unrestricted integer partitions as well as for distinct partitions of integers into a finite number of parts. Szekeres and Canfield have derived an asymptotic formula for the number of partitions that is…

The survey covers several topics related to the asymptotic structure of various combinatorial and analytic objects such as the path spaces in graded graphs (Bratteli diagrams), invariant measures with respect to countable groups, etc. The…

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

We explain how to compute idempotents that correspond to the indecomposable objects in the Hecke category. Closed formulas are provided for some common coefficients that appear in these idempotents. We also explain how to compute…

\cite{HillMotegi2017} present a new general asymptotic theory for the maximum of a random array $\{\mathcal{X}_{n}(i)$ $:$ $1$ $\leq $ $i$ $\leq $ $\mathcal{L}\}_{n\geq 1}$, where each $\mathcal{X}_{n}(i)$ is assumed to converge in…

Staircase tableaux are combinatorial objects that were first introduced due to a connection with the asymmetric simple exclusion process (ASEP) and Askey-Wilson polynomials. Since their introduction, staircase tableaux have been the object…

We introduce the group-compact coarse structure on a Hausdorff topological group in the context of coarse structures on an abstract group which are compatible with the group operations. We develop asymptotic dimension theory for the…

For any $k>1$, we find the asymptotics of the counting function of $k$-th power-free elements in an additive arithmetic semigroup with exponential growth of the abstract prime counting function. This paper continues the authors' earlier…