相关论文: An interpolation theorem

The periodic tiling conjecture (PTC) asserts, for a finitely generated Abelian group $G$ and a finite subset $F$ of $G$, that if there is a set $A$ that solves the tiling equation $\mathbb{1}_F * \mathbb{1}_A = 1$, there is also a periodic…

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

In this paper we consider Modal Team Logic, a generalization of Classical Modal Logic in which it is possible to describe dependence phenomena between data. We prove that most known fragment of Full Modal Team Logic allow the elimination of…

Motivated by questions like: which spatial structures may be characterized by means of modal logic, what is the logic of space, how to encode in modal logic different geometric relations, topological logic provides a framework for studying…

The Casas-Alvero conjecture is about interpolation polynomials. There are some partial proofs of it, but there is not any proof in the general case.In this paper we propose three.

We characterize the initial positions from which the first player has a winning strategy in a certain two-player game. This provides a generalization of Hall's theorem. Vizing's edge coloring theorem follows from a special case.

In the local, characteristic 0, non archimedean case, we consider distributions on GL(n+1) which are invariant under the adjoint action of GL(n). We prove that such distributions are invariant by transposition. This implies that an…

It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…

We introduce the notion of interlaced weak ditalgebras and apply reduction procedures to their module categories to prove a tame-wild dichotomy for the category ${\cal F}(\Delta)$ of $\Delta$-filtered modules for an arbitrary finite…

Given any number field, we prove that there exist arbitrarily shaped constellations consisting of pairwise non-associate prime elements of the ring of integers. This result extends the celebrated Green-Tao theorem on arithmetic progressions…

We show that for integral operators of general form the norm bounds in Lorentz spaces imply certain norm bounds for the maximal function. As a consequence, the a.e. convergence for the integral operators on the Lorentz spaces follows from…

A famous result, conjectured by G\"odel in 1932 and proved by McKinsey and Tarski in 1948, says that $\varphi$ is a theorem of intuitionistic propositional logic IPC iff its G\"odel-translation $\varphi'$ is a theorem of modal logic S4. In…

Let $E, F, E_0, E_1$ be rearrangement invariant spaces; let $a, \mathrm{b}, \mathrm{b}_0, \mathrm{b}_1$ be slowly varying functions and $0< \theta_0,\theta_1<1$. We characterize the interpolation spaces $$\Big(\overline{X}^{\mathcal…

It was recently shown that the theory of linear stochastic systems can be viewed as a particular case of the theory of linear systems on a certain commutative ring of power series in a countable number of variables. In the present work we…

We give an algorithm to determine whether Wilf's conjecture holds for all numerical semigroups with a given multiplicity $m$, and use it to prove Wilf's conjecture holds whenever $m \le 18$. Our algorithm utilizes techniques from polyhedral…

We show that Vopenka's Principle and Vopenka cardinals are indestructible under reverse Easton forcing iterations of increasingly directed-closed partial orders, without the need for any preparatory forcing. As a consequence, we are able to…

We investigate Steel's conjecture in 'The Core Model Iterability Problem', that if $W$ and $R$ are $\Omega+1$-iterable, $1$-small weasels, then $W\leq^{*}R$ iff there is a club $C\subset\Omega$ such that for all $\alpha\in C$, if $\alpha$…

We show that if the weak compactness of a cardinal is made indestructible by means of any preparatory forcing of a certain general type, including any forcing naively resembling the Laver preparation, then the cardinal was originally…

It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at least f(n) elements (n >= 3). This solves a $250 problem of…

We give Woodin's original proof that if there exists a $(\kappa+2)-$strong cardinal $\kappa,$ then there is a generic extension of the universe in which $\kappa=\aleph_\omega,$ $GCH$ holds below $\aleph_\omega$ and…