Related papers: On Chevalley's Extension Theorem
General relativity has previously been extended to incorporate degenerate metrics using Ashtekar's hamiltonian formulation of the theory. In this letter, we show that a natural alternative choice for the form of the hamiltonian constraints…
This short note gives an elementary alternative proof for a theorem of Danilov and Koshevoy on Minkowski summation and unimodularity in discrete convex analysis. It is intended to disseminate this fundamental theorem and make its proof…
In this short note we give counterexamples to several results related to extension theorems published recently.
We discuss two variations of Edwards' duality theorem. More precisely, we prove one version of the theorem for cones not necessarily containing all constant functions. In particular, we allow the functions in the cone to have a non-empty…
Let W be a finite reflection group acting orthogonally on R^n, P be the Chevalley polynomial mapping determined by an integrity basis of the algebra of W-invariant polynomials, and h be the highest degree of the coordinate polynomials in…
We discuss the use of matrices for providing sequences of rationals that approximate algebraic irrationalities. In particular, we study the regular representation of algebraic extensions, proving that ratios between two entries of the…
Backwards analysis, first popularized by Seidel, is often the simplest most elegant way of analyzing a randomized algorithm. It applies to incremental algorithms where elements are added incrementally, following some random permutation,…
In extension theory, in particular in dimension theory, it is frequently useful to represent a given compact metrizable space X as the limit of an inverse sequence of compact polyhedra. We are going to show that, for the purposes of…
Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…
In this paper generalize Robinson's version of an order cancellation law for subsets of vector spaces in which we cancel by unbounded sets. We introduce the notion of weakly narrow sets in normed spaces, study their properties and prove the…
This manuscript establishes several sufficient conditions for the validity of both the reverse order law and forward order law for NDMPI. Additionally, some characterization of the reverse order law of the NDMPI is obtained. We also explore…
We point out that several terms in the third-order corrections to the slow-roll power spectra presented by Ballardini et al. [1] are incorrect. The authors of that work claim that their result differ from the ones originally presented by…
Alon's combinatorial Nullstellensatz, and in particular the resulting nonvanishing criterion is one of the most powerful algebraic tools in combinatorics, with many important applications. In this paper we extend the nonvanishing theorem in…
This paper deals with well-known extensions of the Prufer domain concept to arbitrary commutative rings. We investigate the transfer of these notions in trivial ring extensions (also called idealizations) of commutative rings by modules and…
The union-closed sets conjecture (sometimes referred to as Frankl's conjecture) states that every finite, nontrivial union-closed family of sets has an element that is in at least half of its members. Although the conjecture is known to be…
The author presents a new proof of injectivity of the composition of the inverse of the rational Chern Character in homology applied to the classifying space BG of a (countable) discrete group G, restricted to dimensions less or equal than…
Association of some integers n >= 54 to divisibility classes in the Shevelev article of 2007 is corrected.
We present a version of a proof by Andy Chermak of the existence and uniqueness of centric linking systems associated to arbitrary saturated fusion systems. This proof differs from the one by Chermak in that it is based on the computation…
Upon presenting the proof of Theorem 3.3 in "Maximal chains in $$ and ultrapowers of the integers" I discovered that it is not entirely correct and certainly some details should be added. I have therefore written an addendum to the paper…
New insights into the combinatorial structure of the Mandelbrot set are given by `Correspondence' and `Translation' Principles both conjectured and partially proved by E. Lau and D. Schleicher. We provide complete proofs of these principles…