相关论文: An ansatz for the asymptotics of hypergeometric mu…

We provide involutory symmetric generating sets of finitely generated Coxeter groups, fulfilling a suitable finiteness condition, which in particular is fulfilled in the finite, affine and compact hyperbolic cases.

Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…

We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…

We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…

We determine the asymptotics of the number of independent sets of size $\lfloor \beta 2^{d-1} \rfloor$ in the discrete hypercube $Q_d = \{0,1\}^d$ for any fixed $\beta \in [0,1]$ as $d \to \infty$, extending a result of Galvin for $\beta…

We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence…

A method is described to sum multi-dimensional arithmetic functions subject to hyperbolic summation conditions, provided that asymptotic formulae in rectangular boxes are available. In combination with the circle method, the new method is a…

We show that a wide variety of generalized increasing subsequence problems admit a one parameter family of extensions for which we can exactly compute the mean length of the longest increasing subsequence. By the nature of the extension,…

We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…

We study integral representations of the Gevrey series solutions of irregular hypergeometric systems. In this paper we consider the case of the systems associated with a one row matrix, for which the integration domains are one dimensional.…

We show that an entire branched cover of finite distortion cannot have a compact branch set if its distortion satisfies a certain asymptotic growth condition. We furthermore show that this bound is strict by constructing an entire,…

We consider the uniform asymptotic expansion for the Gauss hypergeometric function \[{}_2F_1(a+\epsilon\lambda,b;c+\lambda;x),\qquad 0<x<1\] as $\lambda\to+\infty$ in the neigbourhood of $\epsilon x=1$ when the parameter $\epsilon>1$ and…

The present note considers a certain family of sums indexed by the set of fixed length compositions of a given number. The sums in question cannot be realized as weighted compositions. However they can be be related to the hypergeometric…

Much of the progress in the gravitational self-force problem has involved the use of singular perturbation techniques. Yet the formalism underlying these techniques is not widely known. I remedy this situation by explicating the foundations…

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

In this paper we continue our earlier investigations into the asymptotic behaviour of infinite systems of coupled differential equations. Under the mild assumption that the so-called characteristic function of our system is completely…

We use geometric measure theory to introduce the notion of asymptotic cones associated with a singular subspace of a Riemannian manifold. This extends the classical notion of asymptotic directions usually defined on smooth submanifolds. We…

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

We propose a strategy for approximating Pareto optimal sets based on the global analysis framework proposed by Smale (Dynamical systems, New York, 1973, pp. 531-544). The method highlights and exploits the underlying manifold structure of…

This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…