Related papers: A four parameter generalization of Gollnitz's (BIG…
Machine learning algorithms use error function minimization to fit a large set of parameters in a preexisting model. However, error minimization eventually leads to a memorization of the training dataset, losing the ability to generalize to…
We study structural aspects of randomized parameterized computation. We introduce a new class ${\sf W[P]}$-${\sf PFPT}$ as a natural parameterized analogue of ${\sf PP}$. Our definition uses the machine based characterization of the…
The strong recurrence is equivalent to the Riemann hypothesis. In the present paper, we give a simple proof of the generalized strong recurrence for all non-zero parameters.
In his solution of Hilbert's 17th problem Artin showed that any positive definite polynomial in several variables can be written as the quotient of two sums of squares. Later Reznick showed that the denominator in Artin's result can always…
We prove a constant term conjecture of Robbins and Zeilberger (J. Combin. Theory Ser. A 66 (1994), 17-27), by translating the problem into a determinant evaluation problem and evaluating the determinant. This determinant generalizes the…
Any one measurement with polarized light makes it possible to fix the Mueller matrices of the Lorentz type with up to four arbitrary numeric parameters (x, u; z, w). These parameters are subject to the quadratic condition. It is…
We prove polynomial boson-fermion identities for the generating function of the number of partitions of $n$ of the form $n=\sum_{j=1}^{L-1} j f_j$, with $f_1\leq i-1$, $f_{L-1} \leq i'-1$ and $f_j+f_{j+1}\leq k$. The bosonic side of the…
One studies a particular algebraic system where the unknowns are matrices. We solve this system according to the parameters values thanks to the theory of Grobner basis.
An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…
This paper is divided into two parts. The first is a review, through categorical lenses, of the classical theory of regular-singular differential systems over $C((x))$ and $\mathbb P^1_C\smallsetminus\{0,\infty\}$, where $C$ is…
In this paper we investigate the uniform distribution properties of polynomials in many variables and bounded degree over a fixed finite field F of prime order. Our main result is that a polynomial P : F^n -> F is poorly-distributed only if…
We present a general formalism with the aim of describing the situation of an entity, how it is, how it reacts to experiments, how we can make statistics with it, and how it changes under the influence of the rest of the universe. Therefore…
Structural identifiability is a property of an ODE model with parameters that allows for the parameters to be determined from continuous noise-free data. This is a natural prerequisite for practical identifiability. Conducting multiple…
The two parameters quantum algebra $SU_{p,k}(2)$ can be obtained from a single parameter algebra $SU_q(2)$. This fact gives some relations between $SU_{p,k}(2)$ quantities and the corresponding ones of the $SU_q(2)$ algebra. In this paper…
In 1969, Andrews proved a theorem on partitions with difference conditions which generalises Schur's celebrated partition identity. In this paper, we generalise Andrews' theorem to overpartitions. The proof uses q-differential equations and…
The paper gives a bound on the generalization error of the Gibbs algorithm, which recovers known data-independent bounds for the high temperature range and extends to the low-temperature range, where generalization depends critically on the…
It was recently shown that $q\omega(q)$, where $\omega(q)$ is one of the third order mock theta functions, is the generating function of $p_{\omega}(n)$, the number of partitions of a positive integer $n$ such that all odd parts are less…
We show how Andrews' generating functions for generalized Frobenius partitions can be understood within the theory of Eichler and Zagier as specific coefficients of certain Jacobi forms. This reformulation leads to a recursive process which…
We present a formalization of Gr\"obner basis theory in Lean 4, built on top of Mathlib's infrastructure for multivariate polynomials and monomial orders. Our development covers the core foundations of Gr\"obner basis theory, including…
We revisit the problem of general identifiability originally introduced in [Lee et al., 2019] for causal inference and note that it is necessary to add positivity assumption of observational distribution to the original definition of the…