Related papers: Sequence Positivity Through Numeric Analytic Conti…
Suppose we are given an infinite sequence of input cells, each initialized with a uniform random symbol from $[n]$. How hard is it to output a sequence in $[n]^n$ that is close to a uniform random permutation? Viola (SICOMP 2020)…
Relying on the analysis of characteristics, we prove the uniqueness of conservative solutions to the variational wave equation $u_{tt}-c(u) (c(u)u_x)_x=0$. Given a solution $u(t,x)$, even if the wave speed $c(u)$ is only H\"older continuous…
When assessing risks on a finite-time horizon, the problem can often be reduced to the study of a random sequence $C(N)=(C_1,\ldots,C_N)$ of random length $N$, where $C(N)$ comes from the product of a matrix $A(N)$ of random size $N \times…
We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (are all terms of a given LRS positive?) and the Ultimate Positivity Problem} (are all but finitely many terms of a…
This paper studies when a sequence of probability measures on a metric space admit subsequential weak limits. A sufficient condition called sequential tightness is formulated, which relaxes some assumptions for asymptotic tightness used in…
We prove refined generating series formulae for characters of (virtual) cohomology representations of external products of suitable coefficients, e.g., (complexes of) constructible or coherent sheaves, or (complexes of) mixed Hodge modules…
This work investigates preserving and reversing unimodality and convexity properties for sequences under transformations defined by sign-regular kernels. It is shown that these transformations only preserve these properties if the kernels…
We introduce the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence, and we prove a variant of Cobham's theorem for the newly introduced class of sequences.
For a smooth finite cyclic covering over a projective space of dimension greater than one, we show that the group of automorphisms acts faithfully on the cohomology except for a few cases. In characteristic zero, we study the equivariant…
Generative molecular design has moved from proof-of-concept to real-world applicability, as marked by the surge in very recent papers reporting experimental validation. Key challenges in explainability and sample efficiency present…
We consider the Cauchy problem for homogeneous linear $q$-difference-differential equations with constant coefficients. We characterise convergent, $k$-summable and multisummable formal power series solutions in terms of analytic…
This paper proposes an efficient algorithm for testing copositivity of homogeneous polynomials over the positive semidefinite cone. The algorithm is based on a novel matrix optimization reformulation and requires solving a hierarchy of…
The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion…
This paper is concerned with multivariate refinements of the gamma-positivity of Eulerian polynomials by using the succession and fixed point statistics. Properties of the enumerative polynomials for permutations, signed permutations and…
The present paper is a continuation of our work on curved finitary spacetime sheaves of incidence algebras and treats the latter along Cech cohomological lines. In particular, we entertain the possibility of constructing a non-trivial de…
Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…
We introduce a cohomology, called extendable cohomology, for abstract complex singular varieties based on suitable differential forms. Beside a study of the general properties of such a cohomology, we show that, given a complex vector…
We develop a generative model-based approach to Bayesian inverse problems, such as image reconstruction from noisy and incomplete images. Our framework addresses two common challenges of Bayesian reconstructions: 1) It makes use of complex,…
We study the problem of sequentially predicting properties of a probabilistic model and its next outcome over an infinite horizon, with the goal of ensuring that the predictions incur only finitely many errors with probability 1. We…
We provide a rigorous analysis for the so-called endlessly continuable germs of holomorphic functions or in other words, the Ecalle's resurgent functions. We follow and complete an approach due to Pham, based on the notion of discrete…