Related papers: One-dependent trigonometric determinantal processe…
M. E. Larsen evaluated the Wronskian determinant of functions $\{\sin(mx)\}_{1\le m \le n}$. We generalize this result and compute the Wronskian of $\{\sin(mx)\}_{1\le m \le n-1}\cup \{\sin((k+n)x\} $. We show that this determinant can be…
We develop a method of transverse momentum dependent (TMD) operator expansion that yields the TMD factorization theorem on the operator level. The TMD operators are systematically ordered with respect to TMD-twist, which allows a certain…
A real arithmetic function f is multiplicatively monotonous if f (mn) -- f (m) has constant sign for m, n positive integers. Properties and examples of such functions are discussed, with applications to positive hermitian…
The higher dimensional autoregressive models would describe some of the econometric processes relatively generically if they incorporate the heterogeneity in dependence on times. This paper analyzes the stationarity of an autoregressive…
We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…
In the one-parameter family of power-law maps of the form $f_a(x)=-|x|^{\alpha}+a,$ $\alpha >1,$ we give examples of mutually related dynamically determined quantities, depending on the parameter $a$, such that one is a Pick function of the…
Pickands dependence functions characterize bivariate extreme value copulas. In this paper, we study the class of polynomial Pickands functions. We provide a solution for the characterization of such polynomials of degree at most $m+2$,…
The multivariate Meixner polynomials are shown to arise as matrix elements of unitary representations of the $SO(d,1)$ group on oscillator states. These polynomials depend on $d$ discrete variables and are orthogonal with respect to the…
An $n$-independent set in two dimensions is a set of nodes admitting (not necessarily unique) bivariate interpolation with polynomials of total degree at most $n.$ For an arbitrary $n$-independent node set $\mathcal X$ we are interested…
The parity decision tree model extends the decision tree model by allowing the computation of a parity function in one step. We prove that the deterministic parity decision tree complexity of any Boolean function is polynomially related to…
We are studying stationary random processes with conditional polynomial moments that allow a continuous path modification. Processes with continuous path modification, are important because they are relatively easy to simulate. One does not…
In this paper, we estimate the linear independence measures for the values of a class Mahler functions of degree one and two. For the purpose, we study the determinants of suitable Hermite-Pad\'{e} approximation polynomials. Based on the…
We construct a non-trivial type of 1-step exceptional Bannai-Ito polynomials which satisfy discrete orthogonality by using a generalized Darboux transformation. In this generalization, the Darboux transformed Bannai-Ito operator is directly…
We determine the probability that a random n x n symmetric matrix over {1, 2, ... , m} has determinant divisible by m.
We develop a coordinate-free probabilistic framework for determinantal point processes associated with Bergman kernels on compact complex manifolds. The basic issue is that Bergman kernels are naturally line-bundle-valued:…
A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…
The present paper is a continuation of our work [11], where we introduced a fractional operator calculus related to a fractional ${\psi}-$Fueter operator in the one-dimensional Riemann-Liouville derivative sense in each direction of the…
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…
We prove that the simplex method with the highest gain/most-negative-reduced cost pivoting rule converges in strongly polynomial time for deterministic Markov decision processes (MDPs) regardless of the discount factor. For a deterministic…
New algorithms are presented for computing annihilating polynomials of Toeplitz, Hankel, and more generally Toeplitz+ Hankel-like matrices over a field. Our approach follows works on Coppersmith's block Wiedemann method with structured…