English
Related papers

Related papers: Comments on a Theorem by Ancona

200 papers

The aim of this paper is to describe the origin, first solutions, further progress, the state of art, and a new ansatz in the treatment of a problem dating back to the 1920's, which still has not found a satisfactory solution and deserves…

Complex Variables · Mathematics 2011-02-17 Norbert Steinmetz

On [3, p. 199] one says "We mention parenthetically that the proof of [99, Lemma 41.3] is incorrect, and we do not know whether it, [99, Theorem 41.5] and [99, Theorem 41.6] are true". The previously cited reference [99] is our reference…

Functional Analysis · Mathematics 2009-10-21 M. D. Voisei

We discuss and give elementary proofs of results of Brion and of Lawrence-Varchenko on the lattice-point enumerator generating functions for polytopes and cones. This largely expository note contains a new proof of Brion's Formula using…

Combinatorics · Mathematics 2010-03-29 Matthias Beck , Christian Haase , Frank Sottile

We give another bit of evidence that forcing axioms provide proper framework for rigidity of quotient structures, by improving the OCA lifting theorem proved by the author in late 20th century and greatly simplifying its proof. In the…

Logic · Mathematics 2025-07-10 Ilijas Farah

It is not the purpose of this correspondence to complain about that six out of seven theorems listed in Porcu and Schilling (arXiv:0812.2936; 2011, Bernoulli) belong to others, but not to the authors themselves. This is simply a call for…

Statistics Theory · Mathematics 2012-07-31 Chunsheng Ma

In this note, we establish the validity of a conjecture recently proposed in Mathematics Magazine and connect it to the existing interesting results

Probability · Mathematics 2025-04-22 Yaakov Malinovsky

In this note, we prove a theorem covering Chartrand, Kaigars, and Lick's theorem in [Proc. Amer. Math. Soc. 32 (1972), 63-68]. As an application, we give a simpler proof of theorem proved by Mader [J. Graph Theory 65 (2010), 61-69. (Theorem…

Combinatorics · Mathematics 2025-03-10 Zhong Huang , Meng Ji

I describe the early (1974--75) work I did on what is now called the Zeno problem in quantum mechanics. Then I propose a new formulation which may obviate a vexing problem of operator limits and which also may be more…

Quantum Physics · Physics 2007-05-23 Karl Gustafson

C.Swartz' result on tensor product measures is reviewed with proofs from the scratch.

Functional Analysis · Mathematics 2017-01-13 Shigeru Yamagami

This article is the text of a commentary on a talk delivered by Mark Textor entitled 'Brentano's Positing Theory of Existence' in December 2015. It contains ideas on implementing Textor's Neo-Brentanian theory of existence in a natural…

Logic · Mathematics 2023-04-18 Nils Kürbis

This comment has been withdrawn by the authors due to crucial error.

Mesoscale and Nanoscale Physics · Physics 2007-11-22 G. Malpuech , D. D. Solnyshkov , I. A. Shelykh

The \v{C}ern\'y's conjecture states that for every synchronizing automaton with n states there exists a reset word of length not exceeding (n-11)^2. We prove this conjecture for a class of automata preserving certain properties of intervals…

Formal Languages and Automata Theory · Computer Science 2012-07-12 M. Grech , A. Kisielewicz

In [AL11], S.S Abhyankar and I. Luengo introduce a new theory of dicritical divisors in the most general framework. Here we simplify and generalize their results (see Theorems 3.1 and 3.2).

Commutative Algebra · Mathematics 2011-08-19 Vincent Cossart , Mickaël Matusinski

This paper has been withdrawn by the authors as requested by the journal.

Chaotic Dynamics · Physics 2015-05-13 Lun-Shin Yao , Dan Hughes

We prove two theorems on cohomologically complete complexes. These theorems are inspired by, and yield an alternative proof of, a recent theorem of P. Schenzel on complete modules.

Commutative Algebra · Mathematics 2014-04-30 Amnon Yekutieli

In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, is enough to reduce the computational complexity of some…

Computational Complexity · Computer Science 2013-05-27 Michael Brand

In the early 1980s, Mills, Robbins and Rumsey conjectured, and in 1996 Zeilberger proved a simple product formula for the number of $n \times n$ alternating sign matrices with a 1 at the top of the $i$-th column. We give an alternative…

Combinatorics · Mathematics 2007-05-23 Ilse Fischer

A new tool is introduced, specially tailored for the study of order 2 bases of N. It is called the Erdos-Tuan algebra since it suits well their conjecture.

Number Theory · Mathematics 2015-07-22 Labib Haddad

In this note, we introduce a very crude but natural notion of measure on the class of left R-modules over a ring R. We use this notion to give short proofs of some classical theorems on (left) Artinian rings and modules, due to Akizuki,…

Rings and Algebras · Mathematics 2025-03-05 Donovan Leyba , Zachary Mesyan , Greg Oman

A history of two Rolle Theorems, about the root of derivative and about root interval from 1690 till the end of XIX century.

History and Overview · Mathematics 2015-03-12 Galina Sinkevich