Related papers: Sylvester-Cayley vector partitions algorithm and t…
To derive an eigenvalue problem for the associated Askey-Wilson polynomials, we consider an auxiliary function in two variables which is related to the associated Askey-Wilson polynomials introduced by Ismail and Rahman. The Askey-Wilson…
In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur's celebrated partition identity (1926). Andrews' two generalisations of Schur's theorem went on to become two of the most…
We introduce an efficient algorithm for computing fractional integrals and derivatives and apply it for solving problems of the calculus of variations of fractional order. The proposed approximations are particularly useful for solving…
The possibilities of exploiting the special structure of d.c. programs, which consist of optimizing the difference of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An…
J. J. Sylvester's four-point problem asks for the probability that four points chosen uniformly at random in the plane have a triangle as their convex hull. Using a combinatorial classification of points in the plane due to Goodman and…
Continuous-variable Gaussian entanglement is an attractive notion, both as a fundamental concept in quantum information theory, based on the well-established Gaussian formalism for phase-space variables, and as a practical resource in…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
Graeffe iteration was the choice algorithm for solving univariate polynomials in the XIX-th and early XX-th century. In this paper, a new variation of Graeffe iteration is given, suitable to IEEE floating-point arithmetics of modern digital…
The seminal papers of Pickands [1,2] paved the way for a systematic study of high exceedance probabilities of both stationary and non-stationary Gaussian processes. Yet, in the vector-valued setting, due to the lack of key tools including…
We present a high-order spacetime numerical method for discretizing and solving linear initial-boundary value problems using wavelet-based techniques with user-prescribed error estimates. The spacetime wavelet discretization yields a system…
The number of sequences of odd length in strict partitions (denoted as $\mathrm{sol}$), which plays a pivotal role in the first paper of this series, is investigated in different contexts, both new and old. Namely, we first note a direct…
The graph partitioning problem is a well-known NP-hard problem. In this paper, we formulate a 0-1 quadratic integer programming model for the graph partitioning problem with vertex weight constraints and fixed vertex constraints, and…
In 1918, Hardy and Ramanujan made a breakthrough by developing the circle method to deduce an asymptotic formula for the partition function $p(n)$, which was later refined by Rademacher in 1937 to produce an absolutely convergent series…
In this work, we extend the robust version of the Sylvester-Gallai theorem, obtained by Barak, Dvir, Wigderson and Yehudayoff, and by Dvir, Saraf and Wigderson, to the case of quadratic polynomials. Specifically, we prove that if…
The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by…
We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…
We examine several numerical techniques for the calculation of the dynamics of quantum systems. In particular, we single out an iterative method which is based on expanding the time evolution operator into a finite series of Chebyshev…
The discretized Bethe-Salpeter eigenvalue problem arises in the Green's function evaluation in many body physics and quantum chemistry. Discretization leads to a matrix eigenvalue problem for $H \in \mathbb{C}^{2n\times 2n}$ with a…
A new algorithm for deciding the satisfiability of polynomial formulas over the reals is proposed. The key point of the algorithm is a new projection operator, called sample-cell projection operator, custom-made for Conflict-Driven Clause…
In this paper a new approach is derived in the context of shape theory. The implemented methodology is motivated in an open problem proposed in \citet{GM93} about the construction of certain shape density involving Euler hypergeometric…