Related papers: Towards an automation of the circle method
This overview is devoted to splitting methods, a class of numerical integrators intended for differential equations that can be subdivided into different problems easier to solve than the original system. Closely connected with this class…
We set up a combinatorial framework for inclusion-exclusion on the partitions into distinct parts to obtain an alternative generating function of partitions into distinct and non-consecutive parts. In connection with Rogers-Ramanujan…
In this article we present first an algorithm for calculating the determining equations associated with so-called ``nonclassical method'' of symmetry reductions (a la Bluman and Cole) for systems of partial differentail equations. This…
This paper considers optimization problems on Riemannian manifolds and analyzes iteration-complexity for gradient and subgradient methods on manifolds with non-negative curvature. By using tools from the Riemannian convex analysis and…
An extension of Riewe's fractional Hamiltonian formulation is presented for fractional constrained systems. The conditions of consistency of the set of constraints with equations of motion are investigated. Three examples of fractional…
We prove two new summation formulae of Hall-Littlewood polynomials over partitions into bounded parts and derive some new multiple $q$-identities of Rogers-Ramanujan type.
We evaluate binomial series with harmonic number coefficients, providing recursion relations, integral representations, and several examples. The results are of interest to analytic number theory, the analysis of algorithms, and…
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…
Numerical continuation in the context of optimization can be used to mitigate convergence issues due to a poor initial guess. In this work, we extend this idea to Riemannian optimization problems, that is, the minimization of a target…
We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set…
An analytical-numeric calculation method of extremely complicated integrals is presented. These integrals appear often in magnet soliton theory. The appropriate analytical continuation and a corresponding integration contour allow to reduce…
Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often…
We consider Hadamard fractional derivatives and integrals of variable fractional order. A new type of fractional operator, which we call the Hadamard-Marchaud fractional derivative, is also considered. The objective is to represent these…
Let $\overline{p}_o(n)$ denote the number of overpartitions of $n$ into odd parts. The partition function $\overline{p}_o(n)$ has been the subject of many recent studies where many explicit Ramanujan-like congruences were discovered. In…
Asymptotic formulas of the number of various partitions are studied, like 3-colored partitions, concave partitions, certain plane partitions, partitions without small parts, the number of p-rings.
In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…
This article analyzes the periodic orbits of Syracuse dynamical systems in a novel algebraic setting: the commutative ring of graded $n$-adic integers. Within this context, this article introduces a dual-radix modular division algorithm for…
We make an experimental comparison of methods for computing the numerical radius of an $n\times n$ complex matrix, based on two well-known characterizations, the first a nonconvex optimization problem in one real variable and the second a…
We study certain arithmetic properties of an analogue $B(n)$ of Lin's restricted partition function that counts the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ and $\pi_2$ comprise distinct odd parts and…
This habilitation thesis summarizes the research that I have carried out from 2005 to 2019. It is organized in four chapters. The first three deal with random planar maps. Chapter 1 is about their metric properties: from a general…