Related papers: Computational aspects of rational residuosity

Let $b \geq 2$ be an integer and $S$ be a finite non-empty set of primes not containing divisors of $b$. For any non-dense set $A \subset [0,1)$ such that $A \cap \mathbb{Q}$ is invariant under $\times b$ operation, we prove the finiteness…

We establish discrete and continuous log-concavity results for a biparametric extension of the $q$-numbers and of the $q$-binomial coefficients. By using classical results for the Jacobi theta function we are able to lift some of our…

We present a symbolic representation for the poly-Bernoulli numbers. This allows us to prove several new iterated integral representations for the poly-Bernoulli numbers, including an integral transform of the Bernoulli-Barnes numbers. We…

We show how all the quantal systems related to the exceptional Laguerre and Jacobi polynomials can be constructed in a direct and systematic way, without the need of shape invariance and Darboux-Crum transformation. Furthermore, the…

A set $R\subset \mathbb{N}$ is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers,…

Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…

Let us consider a cyclic extension of a function field defined over a finite field. For a character (non-trivial) of this extension, we calculate, as a linear combinations of products of Jacobi sums, the coefficients of the polynomial given…

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

In this paper, we study a class of orthogonal polynomials defined by a three-term recurrence relation with periodic coefficients. We derive explicit formulas for the generating function, the associated continued fraction, the orthogonality…

The main theme of this dissertation is the study of the lattice points in a rational convex polyhedron and their encoding in terms of Barvinok's short rational functions. The first part of this thesis looks into theoretical applications of…

We explicitly determine the values of reduced cyclotomic periods of order $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. These evaluations are applied to obtain explicit factorizations of the corresponding…

This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating and proving properties about the…

Periods of rational integrals appear in quantum mechanics through asymptotic expansions of traces computed with the semiclassical symbol calculus. We develop a novel formal series expansion for the trace of the Dirac delta of a differential…

Rational solutions of the fourth order analogue to the Painlev'e equations are classified. Special polynomials associated with the rational solutions are introduced. The structure of the polynomials is found. Formulas for their coefficients…

Consider a planar polynomial vector field $X$, and assume it admits a symbolic first integral $\mathcal{F}$, i.e. of the $4$ classes, in growing complexity: Rational, Darbouxian, Liouvillian and Riccati. If $\mathcal{F}$ is not rational, it…

Hyper-Positive Real, matrix-valued, rational functions are associated with absolute stability (the Lurie problem). Here, quantitative subsets of Hyper-positive functions, related through nested inclusions, are introduced. Structurally, this…

Let $K$ be a field, $a, b\in K$ and $ab\neq 0$. Let us consider the polynomials $g_{1}(x)=x^n+ax+b, g_{2}(x)=x^n+ax^2+bx$, where $n$ is a fixed positive integer. In this paper we show that for each $k\geq 2$ the hypersurface given by the…

In [E. S. Gawlik, Zolotarev iterations for the matrix square root, arXiv preprint 1804.11000, (2018)], a family of iterations for computing the matrix square root was constructed by exploiting a recursion obeyed by Zolotarev's rational…

Any counterexample to the two-dimensional Jacobian Conjecture gives a rational map from one projective plane to another. We use some ideas of the Minimal Model Program to study the combinatorial structure of a rational surface, that is…

We consider multi-agent, convex optimization programs subject to separable constraints, where the constraint function of each agent involves only its local decision vector, while the decision vectors of all agents are coupled via a common…