Related papers: Width Hierarchy for k-OBDD of Small Width
In this paper we extend some previous results on weak pseudo-bosons and on their related bi-coherent states. The role of {\em compatible} functions is discussed in details, and some examples are considered. The pseudo-bosonic ladder…
Consider an $s$-dimensional function being evaluated at $n$ points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out $(s-1)$ variables. Here, the…
We construct explicitly Pad\'e approximations of the second kind for a special class of G-functions. These are then applied to prove a Baker-type lower bound for linear forms in the p-adic values of these functions. Moreover, we consider…
The connected tree-width of a graph is the minimum width of a tree-decomposition whose parts induce connected subgraphs. Long cycles are examples of graphs that have small tree-width but large connected tree-width. We show that a graph has…
Using Bessel-Muirhead system, we can express the K-bessel function defined on a Jordan algebra as linear combination of the J-solutions. We determine explicitly the coefficients when the rank of this Jordan algebra is three after a…
We study images of equilibrium (Gibbs) states for a class of non-invertible transformations associated to conformal iterated function systems with overlaps $\mathcal S$. We prove exact dimensionality for these image measures, and find a…
We define some generalizations of the classical descent and inversion statistics on signed permutations that arise from the work of Sack and Ulfarsson [20] and called after width-k descents and width-k inversionsof type A in Davis's work…
We consider complete Riemannian manifolds with a controlled growth of the covariant derivatives of Ricci curvatures up to order $k-2$ and a controlled decay of the injectivity radii. On such manifolds we construct distance-like functions…
We consider a variant of the Boolean satisfiability problem where a subset E of the propositional variables appearing in formula Fsat encode a symmetric, transitive, binary relation over N elements. Each of these relational variables,…
Out-of-distribution (OOD) detection is essential for determining when a supervised model encounters inputs that differ meaningfully from its training distribution. While widely studied in classification, OOD detection for regression and…
In some applications, one is interested in reconstructing a function $f$ from its Fourier series coefficients. The problem is that the Fourier series is slowly convergent if the function is non-periodic, or is non-smooth. In this paper, we…
We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…
We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…
We consider the problem of chasing convex functions, where functions arrive over time. The player takes actions after seeing the function, and the goal is to achieve a small function cost for these actions, as well as a small cost for…
Binary matrix factorisation is an essential tool for identifying discrete patterns in binary data. In this paper we consider the rank-k binary matrix factorisation problem (k-BMF) under Boolean arithmetic: we are given an n x m binary…
The Koopman framework is a popular approach to transform a finite dimensional nonlinear system into an infinite dimensional, but linear model through a lifting process, using so-called observable functions. While there is an extensive…
The classical ``$H=W$" theorem establishes the identity between two function spaces on an arbitrary nonempty open set in the Euclidean spaces: the space $W$ defined via weak derivatives, and the space $H$ defined as the closure of smooth…
In this paper, we introduce an efficient backpropagation scheme for non-constrained implicit functions. These functions are parametrized by a set of learnable weights and may optionally depend on some input; making them perfectly suitable…
Caucal hierarchy is a well-known class of graphs with decidable monadic theories. It were proved by L. Braud and A. Carayol that well-orderings in the hierarchy are the well-orderings with order types less than $\varepsilon_0$. Naturally,…
In this paper, we consider the problem of finding perfectly balanced Boolean functions with high non-linearity values. Such functions have extensive applications in domains such as cryptography and error-correcting coding theory. We provide…