Related papers: Linear independence criteria for generalized polyl…

A new definition of a multi-valued logarithm on time scales is introduced for delta-differentiable functions that never vanish. This new logarithm arises naturally from the definition of the cylinder transformation that is also at the heart…

Using the theory of Newton Polygons, we formulate a simple criterion for the Galois group of a polynomial to be ``large.'' For a fixed $\alpha \in \Q - \Z_{<0}$, Filaseta and Lam have shown that the $n$th degree Generalized Laguerre…

We consider a $G$-function $F(z)=\sum_{k=0}^{\infty} A_k z^k \in \mathbb{K}[[z]]$, where $\mathbb{K}$ is a number field, of radius of convergence $R$ and annihilated by the $G$-operator $L \in \mathbb{K}(z)[\mathrm{d}/\mathrm{d}z]$, and a…

We consider the Jack--Laurent symmetric functions for special values of parameters p_0=n+k^{-1}m, where k is not rational and m and n are natural numbers. In general, the coefficients of such functions may have poles at these values of p_0.…

We consider a class of weighted harmonic functions in the open upper half-plane known as $\alpha$-harmonic functions. Of particular interest is the uniqueness problem for such functions subject to a vanishing Dirichlet boundary value on the…

We examine the threshold of the cyclicity for functions in Dirichlet-type spaces $\mathcal{D}_{\alpha}$, $\alpha\in(0,1]$. Given a fixed $\alpha^{*}\in(0,1]$, we construct a holomorphic function $f\in\mathcal{D}_{\alpha^{*}}$ which is…

A set of real $n$th roots that is pairwise linearly independent over the rationals must also be linearly independent. We show how this result may be extended to more general fields.

The paper determines all meromorphic functions with finitely many zeros in the plane having the property that a linear differential polynomial in the function, of order at least 3 and with rational functions as coefficients, also has…

In classical function theory, a function is holomorphic if and only if it is complex analytic. For higher dimensional spaces it is natural to work in the context of Clifford algebras. The structures of these algebras depend on the parity of…

This paper presents a counterexample-guided iterative algorithm to compute convex, piecewise linear (polyhedral) Lyapunov functions for uncertain continuous-time linear hybrid systems. Polyhedral Lyapunov functions provide an alternative to…

We give conditions on a finite set of series of rational numbers to ensure that they are algebraically independent. Specialising our results to polynomials of lower degree, we also obtain new results on irrationality and $mathbb{Q}$-linear…

We prove linear independence of indefinite iterated Eisenstein integrals over the fraction field of the ring of formal power series $\mathbb{Z}[[q]]$. Our proof relies on a general criterium for linear independence of iterated integrals,…

Let $p,x$ be real numbers, and $s$ be a complex number, with $\Re(s)>1-r$, $p\geq 1$, and $x+1>0$. The zeta function $Z^{\bf\alpha}_p(s;x)$ is defined by $$ Z^{\bf\alpha}_p(s;x) =\frac{1}{\Gamma(s)}\int^\infty_0 \frac{e^{-xt}}…

We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…

Polymatroids can be considered as "fractional matroid" where the rank function is not required to be integer valued. Many, but not every notion in matroid terminology translates naturally to polymatroids. Defining cyclic flats of a…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

Linear differential equations with polynomial coefficients over a field $K$ of positive characteristic $p$ with local exponents in the prime field have a basis of solutions in the differential extension $\mathcal{R}_p=K(z_1, z_2,…

A loss function measures the discrepancy between the true values (observations) and their estimated fits, for a given instance of data. A loss function is said to be proper (unbiased, Fisher consistent) if the fits are defined over a unit…

The fractional polylogarithms, depending on a complex parameter $\a$, are defined by a series which is analytic inside the unit disk. After an elementary conversion of the series into an integral presentation, we show that the fractional…

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…