Related papers: A refinement of Cauchy-Schwarz complexity
Recently, Komatsu introduced the concept of poly-Cauchy numbers and polynomials which generalize Cauchy numbers and polynomials. In this paper, we consider the new concept of higher-order Cauchy numbers and polynomials which generalize…
Given a Fano manifold $(X,\omega)$ we develop a variational approach to characterize analytically the existence of K\"ahler-Einstein metrics with prescribed singularities, assuming that these singularities can be approximated algebraically.…
We show that an effective version of Siegel's Theorem on finiteness of integer solutions and an application of elementary Galois theory are key ingredients in a complexity classification of some Holant problems. These Holant problems,…
We recall the notions of Fr\"olicher and diffeological spaces and we build regular Fr\"olicher Lie groups and Lie algebras of formal pseudo-differential operators in one independent variable. Combining these constructions with a smooth…
We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each $n\in\mathbb{N}$ and any countable model of…
Let $(\tau_n)_n$ be a sequence of real numbers in $(1,+\infty)$. Using potential theoretic methods, we prove quantitative results - Bernstein-Walsh type theorems - about uniform approximation by polynomials of the form $\sum_{k=\lfloor…
In this paper we compute the coefficients of the reliability polynomial of a consecutive-$k$-out-of-$n$:$F$ system, in Bernstein basis, using the generalized Pascal coefficients. Based on well-known combinatorial properties of the…
The Polynomial-Time Hierarchy ($\mathsf{PH}$) is a staple of classical complexity theory, with applications spanning randomized computation to circuit lower bounds to ''quantum advantage'' analyses for near-term quantum computers.…
We study ternary sequences associated with a multidimensional continued fraction algorithm introduced by the first author. The algorithm is defined by two matrices and we show that it is measurably isomorphic to the shift on the set…
We define counting classes #P_R and #P_C in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over R, or of…
We prove that the periodic initial value problem for a modified Euler-Poisson equation is well-posed for initial data in $H^{s} (T^{m})$ when $s>m/2+2$ and we improve the Sobolev index to $s>3/2$ for $m=1$. We also study the analytic…
This note is an attempt to attack a conjecture of Fraenkel and Simpson stated in 1998 concerning the number of distinct squares in a finite word. By counting the number of (right-)special factors, we give an upper bound of the number of…
An explicit seminorm $||f||_{#}$ on the vector space of Chow vectors of projective varieties is introduced, and shown to be a generalized Mabuchi energy functional for Chow varieties. The singularities of the Chow varieties give rise to…
Consider an ordinary generating function $\sum_{k=0}^{\infty}c_kx^k$, of an integer sequence of some combinatorial relevance, and assume that it admits a closed form $C(x)$. Various instances are known where the corresponding truncated sum…
It is proved that the complex double Fourier series of an integrable function $f(x,y)$ with coefficients $\{c_{jk}\}$ satisfying certain conditions, will converge in $L^{1}$-norm. The conditions used here are the combinations of Tauberian…
For a sequence of random structures with $n$-element domains over a relational signature, we define its first order (FO) complexity as a certain subset in the Banach space $\ell^{\infty}/c_0$. The well-known FO zero-one law and FO…
Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…
This paper focuses on the study of the order of power series that are linear combinations of a given finite set of power series. The order of a formal power series, known as $\textrm{ord}(f)$, is defined as the minimum exponent of $x$ that…
We consider the Cauchy problem for the Burgers hierarchy with general time dependent coefficients. The closed form for the Green's function of the corresponding linear equation of arbitrary order $N$ is shown to be a sum of generalised…
In this paper we show how to apply various techniques and theorems (including Pincherle's theorem, an extension of Euler's formula equating infinite series and continued fractions, an extension of the corresponding transformation that…