相关论文: A Locale for Minimal Bad Sequences

Does there exist for any $\sigma$-algebra a minimal (with respect to inclusion) generating set? We formulate this problem and answer it in the very special instance of partition generated and standard measurable spaces, the general case…

We establish a version of a semistable reduction theorem over a log point with a non-trivial nilpotent structure. In order to do this we extend the classical desingularization theories to non-reduced schemes with generically principal…

We give an optimal version of the classical ``three-gap theorem'' on the fractional parts of $n \theta$, in the case where $\theta$ is an irrational number that is badly approximable. As a consequence, we deduce a version of Kronecker's…

The Lov\'asz Local Lemma is a seminal result in probabilistic combinatorics. It gives a sufficient condition on a probability space and a collection of events for the existence of an outcome that simultaneously avoids all of those events.…

We show that under certain technical assumptions any weakly nonlocal Hamiltonian structure compatible with a given nondegenerate weakly nonlocal symplectic structure $J$ can be written as the Lie derivative of $J^{-1}$ along a suitably…

Opial's Lemma is a fundamental result in the convergence analysis of sequences generated by optimization algorithms in real Hilbert spaces. We introduce the concept of Opial sequences - sequences for which the limit of the distance to each…

Let $R$ be a regular ring containing a field $k$. Let $\mathbf{x} = x_1, \ldots, x_r$ be a regular sequence in $R$ such that $R/(\mathbf{x})$ is a regular ring. Fix $m \geq 1$. Set $A_m = R/(\mathbf{x})^m$. We show that for any ideal $Q$ of…

A rank one local system $\LL$ on a smooth complex algebraic variety $M$ is admissible roughly speaking if the dimension of the cohomology groups $H^m(M,\LL)$ can be computed directly from the cohomology algebra $H^*(M,\C)$. We say that a…

We prove a general structural theorem for a wide family of local algorithms, which includes property testers, local decoders, and PCPs of proximity. Namely, we show that the structure of every algorithm that makes $q$ adaptive queries and…

The purpose of this paper is to study the existence of (weak) periodic solutions for nonlocal fractional equations with periodic boundary conditions. These equations have a variational structure and, by applying a critical point result…

Constructions of optimal locally repairable codes (LRCs) achieving Singleton-type bound have been exhaustively investigated in recent years. In this paper, we consider new bounds and constructions of Singleton-optimal LRCs with minmum…

The decomposition of a density function on a domain into a minimal sum of unimodal components is a fundamental problem in statistics, leading to the topological invariant of unimodal category of a density. This paper gives an efficient…

The Lov\'{a}sz Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser and Tardos have shown that the LLL gives more than just…

We propose a produre of reduction a locally conformal symplectic structure. This procedure of reduction can be applied to wide class of submanifolds. There are no local obstructions for this procedure. But there are global obstructions. We…

The purpose of this article is to present my new proof of the the construction and the convergence theorem of spectral sequences of filtered complexes, which is much shorter and cleaner than the "standard" proof.

Formalised libraries of combinatorial mathematics have rapidly expanded over the last five years, but few use one of the most important tools: probability. How can often intuitive probabilistic arguments on the existence of combinatorial…

We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…

A major problem for the learning of Bayesian networks (BNs) is the exponential number of parameters needed for conditional probability tables. Recent research reduces this complexity by modeling local structure in the probability tables. We…

Some sufficient conditions on a simplicial space $X$ guaranteeing that $X_1\simeq \Omega|X|$ were given by Segal. We give a generalization of this result for multisimplicial spaces. This generalization is appropriate for the reduced bar…

We establish sufficient conditions for perfect simulation of chains of infinite order on a countable alphabet. The new assumption, localized continuity, is formalized with the help of the notion of context trees, and includes the…