Related papers: Mating the Basilica with a Siegel Disk
Let $\mathcal{N} \neq \{0\}$ be a fixed set of integers, closed under multiplication, closed under negation, or containing $\{\pm 1\}$. We prove that any zero of a polynomial in $\mathbf{Z}[X]$ whose coefficients lie in $\mathcal{N}$ can be…
A natural class of weighted Bergman spaces on the symmetrized polydisc is isometrically embedded as a subspace in the corresponding weighted Bergman space on the polydisc. We find an orthonormal basis for this subspace. It enables us to…
We obtain an estimate for uniform approximation rate of bounded analytic in the unit disk functions by logarithmic derivatives of $C$-polynomials, i.e., polynomials, all of whose zeros lie on the unit circle $C:|z|=1$.
We prove that the number of geometrically indecomposable representations of fixed dimension vector d of a canonical algebra C defined over a finite field Fq is given by a polynomial in q (depending on C and d). We prove a similar result for…
We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
A method for computing integrals of polynomial functions on compact symmetric spaces is given. Those integrals are expressed as sums of functions on symmetric groups.
We introduce \`a la Vasilevski the weighted poly-Bergman spaces in the unit disc and provide concrete orthonormal basis and give close expression of their reproducing kernel. The main tool in the description if these spaces is the so-called…
Explicit monoid structure is provided for the class of canonical subfield preserving polynomials over finite fields. Some classical results and asymptotic estimates will follow as corollaries.
We investigate the number of integer solutions to a multiplicative Diophantine approximation problem and show that the associated counting function converges in distribution to a normal law. Our approach relies on the analysis of…
The theta map sends code polynomials into the ring of Siegel modular forms of even weights. Explicit description of the image is known for $g\leq 3$ and the surjectivity of the theta map follows. Instead it is known that this map is not…
Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…
The Gauss--Lucas and B\^{o}cher--Grace--Marden theorems are classical results in the geometry of polynomials. Proofs of the these results are available in the literature, but the approaches are seemingly different. In this work, we show…
We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p in R and q in B, we consider the disk through p and q with the smallest diameter. We prove that for any R and B…
We demonstrate that the checkable/synthesisable split in bidirectional typechecking coincides with existing dualities in polarised System L, also known as polarised $\mu\tilde{\mu}$-calculus. Specifically, positive terms and negative…
We consider orthogonal polynomials on the unit circle with respect to a weight which is a quotient of $q$-gamma functions. We show that the Verblunsky coefficients of these polynomials satisfy discrete Painlev\'e equations, in a Lax form,…
The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric…
A certain notion of canonical equivalence in quantum mechanics is proposed. It is used to relate quantal systems with discrete ones. Discrete systems canonically equivalent to the celebrated harmonic oscillator as well as the quartic and…