English
Related papers

Related papers: Rediscovered theorem of Luzin

200 papers

An old conjecture of Erd{\H{o}}s and Gallai states that every $n$ vertex graph can be decomposed, that is $E(G)$ can be partitioned, into $O(n)$ cycles and edges. The covering version of this conjecture was proven by Pyber in 1985, where it…

Combinatorics · Mathematics 2025-09-09 Saieed Akbari , Jonny Aloni , Arash Beikmohammadi , Alexander Clow

By a theorem of Suslin, a Tor-unital (not necessarily unital) ring satisfies excision in algebraic K-theory. We give a new and direct proof of Suslin's result based on an exact sequence of categories of perfect modules. In fact, we prove a…

K-Theory and Homology · Mathematics 2019-02-20 Georg Tamme

The main goal of this paper is to give a completely elementary proof for the decomposition theorem of Wright convex functions which was discovered by C.\ T.\ Ng in 1987. In the proof, we do not use transfinite tools, i.e., variants of…

Classical Analysis and ODEs · Mathematics 2020-11-23 Zsolt Páles

For a cocycle of invertible real $n$-by-$n$ matrices, the Multiplicative Ergodic Theorem gives an Oseledets subspace decomposition of $\mathbb{R}^n$; that is, above each point in the base space, $\mathbb{R}^n$ is written as a direct sum of…

Dynamical Systems · Mathematics 2017-02-13 Christopher Bose , Joseph Horan , Anthony Quas

In their paper published in 1997, Richmond and Richmond classified metric spaces in which all triangles are degenerate. That result was later reproved by Dovgoshei and Dordovskii in the finite case and it was generalized to finite…

Combinatorics · Mathematics 2020-06-02 Péter G. N. Szabó

In 1853 J. Sylvester introduced a family of double sum expressions for two finite sets of indeterminates and showed that some members of the family are essentially the polynomial subresultants of the monic polynomials associated with these…

Commutative Algebra · Mathematics 2011-06-24 Teresa Krick , Agnes Szanto

Complete infinite multisum sets are eventually linear. After 30 years of sitting in a file cabinet, the proof (thanks to James H. Schmerl) is brought from darkness into light.

Combinatorics · Mathematics 2024-07-09 Steven Finch

We give a notably simpler and shorter proof of H. B. Neumann's result which is stated, cursorly, like this. For any well-ordered subset, A, of a totally ordered semigroup, the set of products of any finite number of elements of A is itself…

Combinatorics · Mathematics 2022-03-03 Labib Haddad

In 1922 Ritt constructed the theory of functional decompositions of polynomials with complex coefficients. In particular, he described explicitly indecomposable polynomial solutions of the functional equation f(p(z))=g(q(z)). In this paper…

Complex Variables · Mathematics 2008-12-31 F. Pakovich

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D \geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Combinatorics · Mathematics 2014-10-24 Béla Csaba , Daniela Kühn , Allan Lo , Deryk Osthus , Andrew Treglown

We prove that Bourgain's separation lemma, Lemma~20.14 [B2] holds at fixed frequencies and their neighborhoods, on sub-lattices, sub-modules of the dual lattice associated with a quasi-periodic Fourier series in two dimensions. And by…

Analysis of PDEs · Mathematics 2022-01-10 W. -M. Wang

In 1927, Artin conjectured that any integer other than -1 or a perfect square generates the multiplicative group $\mathbb{Z}/p\mathbb{Z}^\times$ for infinitely many $p$. In \cite{MoSt}, Moree and Stevenhagen considered a two-variable…

Number Theory · Mathematics 2017-11-20 M. Ram Murty , François Séguin , Cameron L. Stewart

We define two recursive functions obtained by decomposition of a given interval into four close parts and prove two lemmas which determine features of these functions.

Discrete Mathematics · Computer Science 2013-06-11 Mark Korenblit , Vadim E. Levit

In 1952 Lucien Le Cam announced his celebrated result that, for regular univariate statistical models, sets of points of superefficiency have Lebesgue measure zero. After reviewing the turbulent history of early studies of superefficiency,…

Statistics Theory · Mathematics 2009-10-20 Vladimir Vovk

This work is, in part, a generalization of the article by A.A. Bruen ,T.C Bruen and J.M.McQuillan on Desargues Theorem in arXiv:2007.09175[mathCO]July 17,2020. We prove the extension of Desargues theorem in all dimensions, using 4 different…

Combinatorics · Mathematics 2023-02-08 Aiden A Bruen

O. Einstein (2008) proved Bollob\'as-type theorems on intersecting families of ordered sets of finite sets and subspaces. Unfortunately, we report that the proof of a theorem on ordered sets of subspaces had a mistake. We prove two weaker…

Combinatorics · Mathematics 2019-01-16 Sang-il Oum , Sounggun Wee

In this paper we prove that every irreducible representation of a Leibniz algebra can be obtained from irreducible representations of the semisimple Lie algebra from the Levi decomposition. We also prove that - in general - for (semi)simple…

Representation Theory · Mathematics 2015-02-26 Fialowski Alice , Mihálka Éva Zsuzsanna

In 1967, Schmidt wrote a seminal paper [10] on heights of subspaces of R n or C n defined over a number field K, and diophantine approximation problems. The going-down Theorem -- one of the main theorems he proved in his paper -- remains…

Number Theory · Mathematics 2017-09-18 Anthony Poels

Let $n$ be a large number. A subset $A$ of $Z_n$ is complete if $S_A = Z_n$, where $S_A$ is the collection of the subset sums of $A$. Olson proved that if $n$ is a prime and $|A|> 2n^{1/2} $, then $S_A$ is complete. We show that a similar…

Number Theory · Mathematics 2007-05-23 V. Vu

Several Lebesgue-type decomposition theorems in analysis have a strong relation to the operation called: parallel sum. The aim of this paper is to investigate this relation from a new point of view. Namely, using a natural generalization of…

Functional Analysis · Mathematics 2016-09-13 Tamás Titkos