中文
相关论文

相关论文: A simpler proof of Jensen's coding theorem

200 篇论文

Many versions of the Stokes theorem are known. More advanced of them require complicated mathematical machinery to be formulated which discourages the users. Our theorem is sufficiently simple to suit the handbooks and yet it is pretty…

经典分析与常微分方程 · 数学 2011-11-08 Lech Pasicki

We show that under the proper forcing axiom the class of all Aronszajn lines behave like $\sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented…

逻辑 · 数学 2020-03-30 Keegan Dasilva Barbosa

In this paper, we take a unified approach for network information theory and prove a coding theorem, which can recover most of the achievability results in network information theory that are based on random coding. The final single-letter…

信息论 · 计算机科学 2015-05-22 Si-Hyeon Lee , Sae-Young Chung

We prove the existence conjecture for combinatorial designs, answering a question of Steiner from 1853. More generally, we show that the natural divisibility conditions are sufficient for clique decompositions of simplicial complexes that…

组合数学 · 数学 2024-11-28 Peter Keevash

We give an arithmetic version of the recent proof of the triangle removal lemma by Fox [Fox11], for the group $\mathbb{F}_2^n$. A triangle in $\mathbb{F}_2^n$ is a triple $(x,y,z)$ such that $x+y+z = 0$. The triangle removal lemma for…

组合数学 · 数学 2016-02-02 Pooya Hatami , Sushant Sachdeva , Madhur Tulsiani

Let \lambda be a partition of a positive integer n. Let C be a symmetric rigid tensor category over a field k of characteristic 0 or char(k)>n, and let V be an object of C. In our main result (Theorem 4.3) we introduce a finite set of…

量子代数 · 数学 2010-03-16 Shlomo Gelaki

In this paper we go on to discuss about Stanley's theorem in Integer partitions. We give two different versions for the proof of the generalization of Stanley's theorem illustrating different techniques that may be applied to profitably…

组合数学 · 数学 2016-10-07 Suprokash Hazra

We consider the strength and effective content of restricted versions of Hindman's Theorem in which the number of colors is specified and the length of the sums has a specified finite bound. Let $\mathsf{HT}^{\leq n}_k$ denote the assertion…

Edwards' Theorem establishes duality between a convex cone in the space of continuous functions on a compact space and the set of representing or Jensen measures for this cone. In this paper we prove non-compact versions of this theorem.

泛函分析 · 数学 2010-12-24 Nihat G. Gogus , Tony L. Perkins , Evgeny A. Poletsky

In 1969 J. Verhoeff provided the first examples of a decimal error detecting code using a single check digit to provide protection against all single, transposition and adjacent twin errors. The three codes he presented are length 3-digit…

信息论 · 计算机科学 2025-03-11 Larry A. Dunning

We give a pen and paper and (comparatively) much simpler proof to verify of the Four Colour Theorem.

组合数学 · 数学 2025-01-24 Carl Feghali

We prove several versions of N. Alon's "necklace-splitting theorem", subject to additional constraints, as illustrated by the following results. (1) The "almost equicardinal necklace-splitting theorem" claims that, without increasing the…

组合数学 · 数学 2020-09-24 Duško Jojić , Gaiane Panina , Rade Živaljević

We settle a conjecture of Farmer and Ki in a stronger form. Roughly speaking we show that there is a positive proportion of small gaps between consecutive zeros of the zeta-function $\zeta(s)$ if and only if there is a positive proportion…

数论 · 数学 2013-01-16 Maksym Radziwill

We investigate the logical strength of the cohesiveness principle when restricted to finite sequences of sets, denoted by fin-COH, over different base theories. Our main result shows that fin-COH entails $I\Sigma_1^0$ over the weaker base…

逻辑 · 数学 2026-02-17 Mengzhou Sun

We study the singular series associated to a cubic form with integer coefficients. If the number of variables is at least $10$, we prove the absolute convergence (and hence positivity) under the assumption of Davenport's Geometric…

数论 · 数学 2023-10-04 Christian Bernert

In [Kim05], Kim gave a new proof of Siegel's Theorem that there are only finitely many $S$-integral points on $\mathbb P^1_{\mathbb Z}\setminus\{0,1,\infty\}$. One advantage of Kim's method is that it in principle allows one to actually…

Deciding whether or not two polynomials have isomoprhic splitting fields over the rationals is the Field Isomorphism Problem. We consider polynomials of the form $f_n(x) = x^4-nx^3-6x^2+nx+1$ with $n \neq 3$ a positive integer and we let…

数论 · 数学 2024-06-18 David L. Pincus , Lawrence C. Washington

Let $\mathcal{A}$ be a $C^*$-algebra and $\phi:\cA\to L(H)$ be a positive unital map. Then, for a convex function $f:I\to \mathbb{R}$ defined on some open interval and a self-adjoint element $a\in \mathcal{A}$ whose spectrum lies in $I$, we…

泛函分析 · 数学 2007-05-23 Jorge Antezana , Pedro Massey , Demetrio Stojanoff

We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than $\omega_1$ and $-\omega_1$, answering a question of J. Baumgartner. This is done by a Jensen-type iteration,…

逻辑 · 数学 2018-03-13 Dániel T. Soukup

We report an experimental demonstration of Schumacher's quantum noiseless coding theorem. Our experiment employs a sequence of single photons each of which represents three qubits. We initially prepare each photon in one of a set of 8…

量子物理 · 物理学 2009-11-10 Y. Mitsumori , J. A. Vaccaro , S. M. Barnett , E. Andersson , A. Hasegawa , M. Takeoka , M. Sasaki