English
Related papers

Related papers: Some Simplifications in Basic Complex Analysis

200 papers

We classify the computational content of the Bolzano-Weierstrass Theorem and variants thereof in the Weihrauch lattice. For this purpose we first introduce the concept of a derivative or jump in this lattice and we show that it has some…

Logic · Mathematics 2017-03-08 Vasco Brattka , Guido Gherardi , Alberto Marcone

Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…

Logic in Computer Science · Computer Science 2026-02-02 Amirhossein Akbar Tabatabai , Raheleh Jalali

We extend the Brauer-Siegel theorem to new families of number fields, both in the classical setting of asymptotically bad families and in the more general framework due to Tsfasman and Vl\u{a}du\c{t} of asymptotically exact families. We…

Number Theory · Mathematics 2024-05-24 Richard Griffon , Philippe Lebacque , Gaël Rémond

This paper is a study of first-order coherent logic from the point of view of duality and categorical logic. We prove a duality theorem between coherent hyperdoctrines and open polyadic Priestley spaces, which we subsequently apply to prove…

Logic · Mathematics 2024-06-21 Sam van Gool , Jérémie Marquès

We present a Suffridge-like extension of the Grace-Szeg\"o convolution theorem for polynomials and entire functions with only real zeros. Our results can also be seen as a $q$-extension of P\'olya's and Schur's characterization of…

Classical Analysis and ODEs · Mathematics 2012-10-04 Martin Lamprecht

Given an element $P(X_1,...,X_d)$ of the finitely generated free Lie algebra, for any Lie algebra $g$ we can consider the induced polynomial map $P: g^d\to g$. Assuming that $K$ is an arbitrary field of characteristic $\ne 2$, we prove that…

Algebraic Geometry · Mathematics 2011-03-01 Tatiana Bandman , Nikolai Gordeev , Boris Kunyavskii , Eugene Plotkin

The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…

Numerical Analysis · Computer Science 2012-11-22 Akitoshi Kawamura , Norbert Th. Müller , Carsten Rösnick , Martin Ziegler

The structure of the set of positivity-preserving maps between matrix algebras is notoriously difficult to describe. The notable exceptions are the results by St{\o}rmer and Woronowicz from 1960s and 1970s settling the low dimensional…

Functional Analysis · Mathematics 2015-12-11 Guillaume Aubrun , Stanisław J. Szarek

We derive B\'ezout identities for the minimal polynomials of a finite sequence and use them to prove a theorem of Wang and Massey on binary sequences with a perfect linear complexity profile. We give a new proof of Rueppel's conjecture and…

Information Theory · Computer Science 2011-08-24 Graham H. Norton

Two proofs of the Koml\'os-Major-Tusn\'ady embedding theorems, one for the uniform empirical process and one for the simple symmetric random walk, are given. More precisely, what are proved are the univariate coupling results needed in the…

Probability · Mathematics 2020-08-10 Manjunath Krishnapur

This work is motivated by the search for an "explicit" proof of the Bloch-Kato conjecture in Galois cohomology, proved by Voevodsky. Our concern here is to lay the foundation for a theory that, we believe, will lead to such a proof- and to…

Algebraic Geometry · Mathematics 2017-10-31 C. De Clercq , M. Florence

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

Logic · Mathematics 2024-10-30 Tamás Kátay , László Márton Tóth , Zoltán Vidnyánszky

The celebrated and famous Weierstrass approximation theorem characterizes the set of continuous functions on a compact interval via uniform approximation by algebraic polynomials. This theorem is the first significant result in…

Classical Analysis and ODEs · Mathematics 2008-05-07 Dilcia Perez , Yamilet Quintana

We give a direct non-abstract proof of the Spectral Mapping Theorem for the Helffer-Sj\"ostrand functional calculus for linear operators on Banach spaces with real spectra and consequently give a new non-abstract direct proof for the…

Spectral Theory · Mathematics 2012-07-16 Narinder S Claire

We develop a generalization of manifold calculus in the sense of Goodwillie-Weiss where the manifold is replaced by a simplicial complex. We consider functors from the category of open subsets of a fixed simplical complex into the category…

Geometric Topology · Mathematics 2017-11-21 Steffen Tillmann

In this paper the authors provide a complete answer to Donkin's Tilting Module Conjecture for all rank $2$ semisimple algebraic groups and $\text{SL}_{4}(k)$ where $k$ is an algebraically closed field of characteristic $p>0$. In the…

Representation Theory · Mathematics 2022-04-18 Christopher P. Bendel , Daniel K. Nakano , Cornelius Pillen , Paul Sobaje

The main goal of this paper is to compute two related numerical invariants of a primitive ideal in the universal enveloping algebra of a semisimple Lie algebra. The first one, very classical, is the Goldie rank of an ideal. The second one…

Representation Theory · Mathematics 2014-08-05 Ivan Losev

Invoking the density argument of Dundas-Goodwillie-McCarthy, we extend the Fundamental Theorem of $K$-theory from the category of simplicial rings to the category of $\mathbb{S}$-algebras. As an intermediate step, we prove the Fundamental…

K-Theory and Homology · Mathematics 2020-04-21 Ernest E. Fontes , Crichton Ogle

We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\LA$ with induction restricted to $\Sigma_1^B$ formulas. This is an improvement over…

Logic in Computer Science · Computer Science 2013-03-27 Ariel Fernández , Michael Soltys

Kashiwara conjectured that the hard Lefshetz theorem and the semisimplicity theorem hold for any semisimple perverse sheaf M on a variety over a field of characteristic 0. He also conjectured that if you apply to such M the nearby cycle…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Drinfeld