Related papers: Capacity bounds on integral flows and the Kostant …
We give a survey of computation of the conformal capacity of planar condensers, generalized capacity, and logarithmic capacity with emphasis on our recent work 2020-2025. We also discuss some applications of our method based on the boundary…
We give a sharp lower bound on the capacity of a real stable polynomial, depending only on the value of its gradient at $x = 1$. This result implies a sharp improvement to a similar inequality proved by Linial-Samorodnitsky-Wigderson in…
Using unitary equivalence of magnetic translation operators, explicit upper and lower convex bounds on the partition function of the Hofstadter model are given for any rational ``flux" and any value of Bloch momenta. These bounds (i)…
The lattice Boltzmann method with enhanced collisions and rest particles is used to calculate the flow in a two-dimensional lid-driven cavity. The abilitity of this method to compute the velocity and the pressure of an incompressible fluid…
An asymptotic solution is derived for the motion of inertial particles exposed to Stokes drag in an unsteady random flow. This solution provides the finite-time Lyapunov exponents as a function of Stokes number and Lagrangian strain- and…
We discuss some applications of signature quantization to the representation theory of compact Lie groups. In particular, we prove signature analogues of the Kostant formula for weight multiplicities and the Steinberg formula for tensor…
Inertial microfluidics is a promising tool for many lab-on-a-chip applications. Particles in channel flows with Reynolds numbers above one undergo cross-streamline migration to a discrete set of equilibrium positions in square and…
We provide a general framework for proving asymptotic equidistribution, convexity, and log concavity of coefficients of generating functions on arithmetic progressions. Our central tool is a variant of Wright's Circle Method proved by two…
An iterative optimization approach that simultaneously minimizes the energy and optimizes the Lagrange multipliers enforcing desired constraints is presented. The method is tested on previously established benchmark systems and it is proved…
Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…
We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…
We study the partition function of a two-dimensional Coulomb gas on a circle, in the presence of external pointlike charges, in a double scaling limit where both the external charges and the number of gas particles are large. Our original…
We develop a least-squares method for computing the analytic capacity of compact plane sets with piecewise-analytic boundary. The method furnishes rigorous upper and lower bounds which converge to the true value of the capacity. Several…
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…
We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…
In this paper, we discuss P(n), the number of ways in which a given integer n may be written as a sum of primes. In particular, an asymptotic form P_as(n) valid for n towards infinity is obtained analytically using standard techniques of…
Kostant's partition function counts the number of ways to represent a particular vector (weight) as a nonnegative integral sum of positive roots of a Lie algebra. For a given weight the $q$-analog of Kostant's partition function is a…
Time-sensitive networks require timely and accurate monitoring of the status of the network. To achieve this, many devices send packets periodically, which are then aggregated and forwarded to the controller. Bounding the aggregate…
Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition…
Kostant's weight $q$-multiplicity formula is an alternating sum over a finite group known as the Weyl group, whose terms involve the $q$-analog of Kostant's partition function. The $q$-analog of the partition function is a polynomial-valued…