Related papers: Evaluation of Sylvester type determinants using bl…
We adopt A. J. Irving's sieve method to study the almost-prime values produced by products of irreducible polynomials evaluated at prime arguments. This generalizes the previous results of Irving and Kao, who separately examined the…
In this paper we introduce a six-parameter generalization of the four-parameter three-variable polynomials on the simplex and we investigate the properties of these polynomials. Sparse recurrence relations are derived by using ladder…
An effective method to obtain exact analytical solutions of equations describing the coherent dynamics of multilevel systems is presented. The method is based on the usage of orthogonal polynomials, integral transforms and their discrete…
For the cluster algebra $\mathcal{A}$ associated with a triangulated surface, we give a characterization of the triangulated surface such that different non-initial cluster monomials in $\mathcal{A}$ have different $f$-vectors. Similarly,…
In this paper, we aim to estimate block-diagonal covariance matrices for Gaussian data in high dimension and in fixed dimension. We first estimate the block-diagonal structure of the covariance matrix by theoretical and practical estimators…
We give simple new proofs of some Hankel determinant evaluations by Omer Egecioglu and Aleksandar Cvetkovic, Predrag Rajkovic and Milos Ivkovic and prove analogous results for sums of moments of symmetric orthogonal polynomials.
The kernel polynomial method based on Jacobi polynomials $P_n^{\alpha,\beta}(x)$ is proposed. The optimal-resolution positivity-preserving kernels and the corresponding damping factors are obtained. The results provide a generalization of…
We propose a scalable algorithmic framework for exact Bayesian variable selection and model averaging in linear models under the assumption that the Gram matrix is block-diagonal, and as a heuristic for exploring the model space for general…
We study two families of orthogonal polynomials. The first is a finite family related to the Askey-Wilson polynomials but the orthogonality is on the real line. A limiting case of this family is an infinite system of orthogonal polynomials…
Working over an arbitrary base scheme, we provide an alternative development of triality which does not use Octonion algebras or symmetric composition algebras. Instead, we use the Clifford algebra of the split hyperbolic quadratic form of…
We connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use this connection to prove that the simplicial complex with k-triangulations as facets is a vertex-decomposable triangulated sphere, and we give a new…
We prove some trigonometric identities involving Chebyshev polynomials of second kind. The identities were inspired by atomic form factor calculations. Generalizations of these identities, if found, will help to increase the numerical…
In this expository paper we compute Hankel determinants of some sequences whose generating functions are given by C-fractions and derive orthogonality properties for associated polynomials.
This paper deals with the determination of the S-curves in the theory of non-hermitian orthogonal polynomials with respect to exponential weights along suitable paths in the complex plane. It is known that the corresponding complex…
Let $K$ be a valued field (in general $K$ is not heselian) with valuation $v$ and $A(x)\in K[x]$ be a polynomial of degree $n$. We find necessary and sufficient conditions for the existence of the elements $s,t,u\in K$, $s\neq 0\neq u$,…
This is an expanded version of the talk given at the conference ``Constructive Functions Tech-04''. We survey some recent results on canonical representation and asymptotic behavior of polynomials orthogonal on the unit circle with respect…
New interpolation and quasi-interpolation operators of Cl\'ement- and Scott-Zhang-type are analyzed on anisotropic polygonal and polyhedral meshes. Since no reference element is available, an appropriate linear mapping to a reference…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
\c{S}tef\u{a}nescu proved an elegant factorization result for polynomials over discrete valuation domains [CASC'2014, Lecture Notes in Computer Science, Ed. by V. Gerdt, W. Koepf, W. Mayr, and E. Vorozhtsov, Springer, Berlin, {Vol.…
This paper is a complement of our recent works on the semilinear Tricomi equations in [8] and[9].