English
Related papers

Related papers: A note on lower bounds for numerical series

200 papers

These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. Indeed I begin with a discussion of the basic rules of mathematical reasoning and of the notion of proof formalized in a natural…

Discrete Mathematics · Computer Science 2008-05-06 Jean Gallier

Much work has been done attempting to understand the dynamic behaviour of the so-called "3x+1" function. It is known that finite sequences of iterations with a given length and a given number of odd terms have some combinatorial properties…

Number Theory · Mathematics 2016-11-21 Olivier Rozier

In this paper we present new, short and elementary proofs of the famous projection and section theorems that are used in Stochastic Calculus.

Probability · Mathematics 2024-12-03 Stefanos Theodorakopoulos

The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…

Computational Complexity · Computer Science 2025-02-04 Prerona Chatterjee , Mrinal Kumar , C Ramya , Ramprasad Saptharishi , Anamay Tengse

We give lower bounds on the number of effective divisors of degree $\leq g-1$ with respect to the number of places of certain degrees of an algebraic function field of genus $g$ defined over a finite field. We deduce lower bounds and…

Algebraic Geometry · Mathematics 2011-04-14 Stéphane Ballet , Robert Rolland

In this paper, we prove that some renowned lower bounds in discrepancy theory admit a discrete analogue. Namely, we prove that the lower bound of the discrepancy for corners in the unit cube due to Roth holds true also for a suitable finite…

Classical Analysis and ODEs · Mathematics 2025-03-06 Luca Brandolini , Bianca Gariboldi , Giacomo Gigante , Alessandro Monguzzi

A linear series on a curve C in $P^3$ is "primary" when it does not contain the series cut by planes. We provide a lower bound for the degree of these series, in terms of deg(C), g(C) and of the number $s = min{i: h^0(I_C(i))\neq 0}$; as a…

alg-geom · Mathematics 2008-02-03 Luca Chiantini , Ciro Ciliberto

Assume G is a nilpotent group of class > 3 in which every proper subgroup has class at most 3. In this note, we give the exact upper bound of class of G.

Group Theory · Mathematics 2023-07-25 Jixia Gao , Haipeng Qu

In this paper, we present a comprehensive system for the treatment of the topic of limits--conceptually, computationally, and formally. The system addresses fundamental linguistic flaws in the standard presentation of limits, which attempts…

General Mathematics · Mathematics 2007-05-23 Frank Swenton

I present a simple, elementary proof of Morley's theorem, highlighting the naturalness of this theorem.

History and Overview · Mathematics 2020-03-31 Stéphane Peigné

The theory of random real numbers is exceedingly well-developed, and fascinating from many points of view. It is also quite challenging mathematically. The present notes are intended as no more than a gateway to the larger theory. They…

Computational Complexity · Computer Science 2012-09-14 Daniel Osherson , Scott Weinstein

This note aims to improve known numerical bounds proved earlier by Chen \cite{PAMS} and Chen-Hacon \cite{Chen-Hacon} and to present some new examples of smooth minimal 3-folds canonically fibred by surfaces (resp. curves) of geometric genus…

Algebraic Geometry · Mathematics 2012-01-04 Meng Chen , Aoxiang Cui

We provide a semi-grammatical description of the set of normal proofs of positive formulae in minimal predicate logic, i.e. a grammar that generates a set of schemes, from each of which we can produce a finite number of normal proofs. This…

Logic in Computer Science · Computer Science 2023-05-03 Gilles Dowek , Ying Jiang

These notes are a self-contained short proof of the stability of persistence diagrams.

Algebraic Topology · Mathematics 2021-03-22 Primoz Skraba , Katharine Turner

Consequence-based reasoning can be used to construct proofs that explain entailments of description logic (DL) ontologies. In the literature, one can find multiple consequence-based calculi for reasoning in the $\mathcal{EL}$ family of DLs,…

Logic in Computer Science · Computer Science 2025-07-30 Christian Alrabbaa , Stefan Borgwardt , Philipp Herrmann , Markus Krötzsch

We find all solutions to the parametrized family of norm-form equations $x^3-(t^3-1)y^3+3(t^3-1)xy+(t^3-1)^2 = \pm 1$ studied by Amoroso, Masser and Zannier. Our proof relies upon an appeal to lower bounds for linear forms in logarithms and…

Number Theory · Mathematics 2021-04-13 Prajeet Bajpai , Michael A. Bennett

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

Algebraic Geometry · Mathematics 2011-12-05 Gabriela Jeronimo , Daniel Perrucci , Elias Tsigaridas

Mathematical proofs are often said to justify their conclusions by indicating the existence of a corresponding formal derivation. We argue that this widespread view relies on an under-examined notion of correspondence, or what it means for…

History and Overview · Mathematics 2026-03-20 Simon DeDeo , Eamon Duede

We present the foundational theory of condensed sets and basic condensed algebra after having introduced key concepts from category theory and homological algebra. In the later sections, we indicate the relevance of condensed mathematics to…

Category Theory · Mathematics 2025-04-01 Noa Bihlmaier , Nick Ruoff , Philipp Schmale

This is a detailed and self-contained introduction to the real number system from a categorical perspective. We begin with the categorical definition of the natural numbers, review the Eudoxus theory of ratios as presented in Book V of…

History and Overview · Mathematics 2013-03-27 Larry Clifton