Related papers: On collection schemes and Gaifman's splitting theo…

Hemaspaandra et al. proved that, for $m > 0$ and $0 < i < k - 1$: if $\Sigma_i^p \BoldfaceDelta DIFF_m(\Sigma_k^p)$ is closed under complementation, then $DIFF_m(\Sigma_k^p) = coDIFF_m(\Sigma_k^p)$. This sharply asymmetric result fails to…

Some interesting recent advances in the theoretical understanding of neural networks have been informed by results from the physics of disordered many-body systems. Motivated by these findings, this work uses the replica technique to study…

In this paper we consider reduction maps $r_{v} : K_{2n+1}(F)/C_{F} \to K_{2n+1}(\kappa_{v})_{l}$ where $F$ is a number field and $C_{F}$ denotes the subgroup of $K_{2n+1}(F)$ generated by $l$-parts (for all primes $l$) of kernels of the…

The Adaptive Multilevel Splitting algorithm is a very powerful and versatile iterative method to estimate the probability of rare events, based on an interacting particle systems. In an other article, in a so-called idealized setting, the…

Let $F=\{\mathbf{p}_0,\ldots,\mathbf{p}_n\}$ be a collection of points in $\mathbb{R}^d.$ The set $F$ naturally gives rise to a family of iterated function systems consisting of contractions of the form $$S_i(\mathbf{x})=\lambda \mathbf{x}…

Given a compact Lie group $G$ acting on a space $X$, the classical Atiyah-Segal completion theorem identifies topological $K$-theory of the homotopy quotient $X/G$ with an explicit completion of $G$-equivariant topological $K$-theory of…

The Neyman-Pearson (NP) binary classification paradigm constrains the more severe type of error (e.g., the type I error) under a preferred level while minimizing the other (e.g., the type II error). This paradigm is suitable for…

We show that the Nash-Williams theorem has a uniform version and that the Galvin theorem does not. We show that there is an $F_\sigma$ tall ideal on $\mathbb{N}$ without a Borel selector and also construct a $\mathbf\Pi^1_2$ tall ideal…

In this paper we prove a combinatorial theorem for finite labellings of trees, and show that it is equivalent to a theorem for finite covers of metric trees and a fixed point theorem on metric trees. We trace how these connections mimic the…

We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…

The aim of this paper is to connect two important and apparently unrelated theories: motivic homotopy theory and ramification theory. We construct motivic homotopy categories over a qcqs base scheme $S$, in which cohomology theories with…

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

In this paper, we define the KW cell system on a graph $\Gamma$, depending on parameters $N\in \mathbb{N}$, $q$ a root of unity, and $\omega$ an $N$-th root of unity. This is a polynomial system of equations depending on $\Gamma$ and the…

We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every…

We consider the effect on the mixing properties of a piecewise smooth interval map $f$ when its domain is divided into $N$ equal subintervals and $f$ is composed with a permutation of these. The case of the stretch-and-fold map $f(x)=mx…

Let $\Lambda$ be a finite-dimensional associative algebra over a field. A semibrick pair is a finite set of $\Lambda$-modules for which certain Hom- and Ext-sets vanish. A semibrick pair is completable if it can be enlarged so that a…

In this paper, we study the problem of learning multi-dimensional Gaussian Mixture Models (GMMs), with a specific focus on model order selection and efficient mixing distribution estimation. We first establish an information-theoretic lower…

Cut-and-project sets $\Sigma\subset\mathbb{R}^n$ represent one of the types of uniformly discrete relatively dense sets. They arise by projection of a section of a higher-dimensional lattice to a suitably oriented subspace. Cut-and-project…

We study the question of existence and fast computation of fair and efficient allocations of indivisible resources among agents with additive valuations. As such allocations may not exist for arbitrary instances, we ask if they exist for…

We study operator-splitting schemes for approximating Koopman generators of linear semigroups induced by nonlinear flows, a framework originating with Dorroh and Neuberger. Building on ideas of Lie, Kowalewski, and Gr\"{o}bner, we analyze…