相关论文: A shorter proof of Lemma A.6 (arXiv:1005.0768)

The textbook proofs of Commoner's theorem characterizing liveness in free-choice Petri nets are given in contexts of technical notions and claims that make the proofs look a bit long. The aim of this note is to give a concise self-contained…

This paper is the second in a series of planned papers which provide first bijective proofs of alternating sign matrix results. Based on the main result from the first paper, we construct a bijective proof of the enumeration formula for…

In this note, the correction to the proof of one theorem in some our previous paper [arXiv:1302.0589] will be given.

This paper consists of two parts. In the first part we prove the fundamental theorem of asset pricing under short sales prohibitions in continuous-time financial models where asset prices are driven by nonnegative, locally bounded…

We give a short and self-contained proof of Levi's Extension Lemma for pseudoline arrangements.

The main result can be given a short and elementary proof which has been incorporated into Lemma 3.2 of arXiv:1206.5775

This note fills a gap in the article with title above [1]. We provide the proof of Equation (82) of Lemma 5 in [1] and thereby complete its power counting analysis with a more precise next-to-leading-order estimate.

New version of my 1998 article. The method of proof of the main results follows the original, but there are many simplifications/streamlining of arguments, especially Lemma 3.6 (new Lemma 3.7). Fixed small error in proof of lower bound for…

In this note we give a short and elementary proof for a part of Amitsur's noncrossed product theorem. Our approach does not rely on well-known results of valuation theory. Instead, we employ some preliminary properties of the unit groups of…

This set of notes re-proves known results on weighted automata (over a field, also known as multiplicity automata). The text offers a unified view on theorems and proofs that have appeared in the literature over decades and were written in…

In logical reasoning, it is often the case that only some of a collection of assumptions are needed to reach a conclusion. A strengthening lemma is an assertion that a given conclusion is independent in this sense of a particular…

Zorn's Lemma is a well-known equivalent of the Axiom of Choice. It is usually regarded as a topic in axiomatic set theory, and its historically standard proof (from the Axiom of Choice) relies on transfinite recursion, a non-elementary…

We present a short proof of the Church-Rosser property for the lambda-calculus enjoying two distinguishing features: Firstly, it employs the Z-property, resulting in a short and elegant proof; and secondly, it is formalized in the nominal…

A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…

Over one year ago, a very long preprint posted on arXiv [arXiv:1709.03771] and HAL announced a proof of Lehmer's Conjecture (and of other related results). Unfortunately, as was remarked by several specialists, this proof contains a (at…

This note points out a gap in the proof of one of the technical results in the paper "Asymptotic Invariants of Base Loci", that appeared in Ann. Inst. Fourier (Grenoble) 56 (2006), 1701-1734. We provide a correct proof of this result.

This paper does not suppose a priori that the evolution of the price of a financial asset is a semimartingale. Since possible strategies of investors are self-financing, previous prices are forced to be finite quadratic variation processes.…

We deal with relatives of GCH which are provable. In particular we deal with rank version of the revised GCH. Our motivation was to find such results when only weak versions of the axiom of choice are assumed but some of the results gives…

This is a companion paper to arXiv:2312.10772. We deduce an equidistribution theorem for periodic nilsequences and use this theorem to give two applications in arithmetic combinatorics. The first application is quasi-polynomial bounds for a…

This note contains a new combinatorial proof of Cramer's rule based on the Gessel-Viennot-Lindstrom Lemma.