相关论文: On the large genus asymptotics of psi-class inters…
We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…
The relations between the Bernoulli and Eulerian polynomials of higher order and the complete Bell polynomials are found that lead to new identities for the Bernoulli and Eulerian polynomials and numbers of higher order. General form of…
Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…
This is an extended version of the thesis presented to the Programa de P\'os-Gradua\c{c}\~ao em Matem\'atica of the Departamento de Matem\'atica, PUC-Rio, in September 2013, incorporating some suggestions from the examining commission.…
Consider a system \Psi of non-constant affine-linear forms \psi_1,...,\psi_t: Z^d -> Z, no two of which are linearly dependent. Let N be a large integer, and let K be a convex subset of [-N,N]^d. A famous and difficult open conjecture of…
We consider a number of combinatorial problems in which rational generating functions may be obtained, whose denominators have factors with certain singularities. Specifically, there exist points near which one of the factors is asymptotic…
A new short clear proof of the asymptotics for the number $c_n$ of real roots of the Bernoulli polynomials $B_n(x)$, as well as for the maximal root $y_n$: $$y_n=\frac{n}{2\pi e}+\frac{\ln(n)}{4\pi e}+O(1)\quad\text{and}\quad…
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…
This text is based on a lecture for the Sheffield Probability Day; its main purpose is to survey some recent asymptotic results about Bernoulli bond percolation on certain large random trees with logarithmic height. We also provide a…
We determine necessary conditions for ample divisors in arbitrary genus as well as for very ample divisors in genus 2 and 3. We also compute the intersection numbers $\lambda^9$ and $\lambda_{g-1}^3$ in genus 4. The latter number is…
We prove that the asymptotic entropy of large simple graphs, as a function of fixed edge and triangle densities, is nondifferentiable along a certain curve.
The distribution of descents in a fixed conjugacy class of $S_n$ is studied, and it is shown that its moments have an interesting property. A particular conjugacy class that is of interest is the class of matchings (also known as fixed…
Although asymptotic analyses of undirected network models based on degree sequences have started to appear in recent literature, it remains an open problem to study statistical properties of directed network models. In this paper, we…
We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…
The large-time asymptotics of the solutions to a class of degenerate parabolic cross-diffusion systems is analyzed. The equations model the interaction of an arbitrary number of population species in a bounded domain with no-flux boundary…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
The sizes of subsets of the natural numbers are typically quantified in terms of asymptotic (linear) and logarithmic densities. These concepts have been generalized to weighted $w$-densities, where a specific weight function $w$ plays a key…
We consider the problem of enumerating permutations in the symmetric group on $n$ elements which avoid a given set of consecutive pattern $S$, and in particular computing asymptotics as $n$ tends to infinity. We develop a general method…
This short note provides a new and simple proof of the convergence rate for Peng's law of large numbers under sublinear expectations, which improves the corresponding results in Song [15] and Fang et al. [3].
We survey recent joint work with M. Rapoport and W. Zhang related to the arithmetic Gan-Gross-Prasad conjecture for Shimura varieties attached to unitary groups.