English
Related papers

Related papers: The Splitting Lemma in any Characteristic

200 papers

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

Probability · Mathematics 2009-03-06 Eugenijus Manstavičius

We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Soki\'c. As a bonus, our proof…

Combinatorics · Mathematics 2015-02-17 Slawomir Solecki , Min Zhao

Algebraic geometry, although little explored in signal processing, provides tools that are very convenient for investigating generic properties in a wide range of applications. Generic properties are properties that hold "almost…

Algebraic Geometry · Mathematics 2016-07-20 Ignat Domanov , Lieven DeLathauwer

Probabilistic separation logic offers an approach to reasoning about imperative probabilistic programs in which a separating conjunction is used as a mechanism for expressing independence properties. Crucial to the effectiveness of the…

Logic in Computer Science · Computer Science 2026-03-03 Janez Ignacij Jereb , Alex Simpson

We call a finite, spanning set of a semi-simple real Lie algebra a distinguished set if it satisfies the following property: The Lie bracket of any two elements out of the set is, up to some constant, another element in the set; conversely,…

Rings and Algebras · Mathematics 2020-04-28 Xudong Chen , Bahman Gharesifard

A central problem in proof-theory is that of finding criteria for identity of proofs, that is, for when two distinct formal derivations can be taken as denoting the same logical argument. In the literature one finds criteria which are…

Logic · Mathematics 2021-10-07 Paolo Pistone

In this extended abstract we provide a unifying framework that can be used to characterize and compare the expressive power of query languages for different data base models. The framework is based upon the new idea of valid partition, that…

This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…

Logic in Computer Science · Computer Science 2022-07-01 Andrea Aler Tubella , Alessio Guglielmi

We present algorithms to classify isolated hypersurface singularities over the real numbers according to the classification by V.I. Arnold (Arnold et al., 1985). This first part covers the splitting lemma and the simple singularities; a…

Algebraic Geometry · Mathematics 2016-01-15 Magdaleen S. Marais , Andreas Steenpass

A characterization of the general linear equation in standard form admitting a maximal symmetry algebra is obtained in terms of a simple set of conditions relating the coefficients of the equation. As a consequence, it is shown that in its…

Classical Analysis and ODEs · Mathematics 2023-01-03 J. C. Ndogmo

A new generalization of the classical separate algebraicity theorem is suggested and proved.

alg-geom · Mathematics 2008-02-03 R. A. Sharipov , E. N. Tzyganov

In the setup of abstract elementary classes satisfying a local version of superstability, we prove the uniqueness property for $\mu$-forking, a certain independence notion arising from splitting. This had been a longstanding technical…

Logic · Mathematics 2018-01-12 Sebastien Vasey

The purpose of this paper is to explain how the identities of various fundamental lemmas fall within the scope of the transfer principle, a general result that allows to transfer theorems about identities of p-adic integrals from one…

Representation Theory · Mathematics 2012-09-18 R. Cluckers , T. Hales , F. Loeser

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

Logic in Computer Science · Computer Science 2010-11-23 Facundo Carreiro

For a Lie algebra L over an algebraically closed field of non-zero characteristic, every finite-dimensional L-module can be decomposed into a direct sum of submodules such that all composition factors of a summand have the same character.…

Rings and Algebras · Mathematics 2013-01-22 Donald W. Barnes

We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…

Logic · Mathematics 2026-02-27 Matthias Kunik

Characteristic formulae give a complete logical description of the behaviour of processes modulo some chosen notion of behavioural semantics. They allow one to reduce equivalence or preorder checking to model checking, and are exactly the…

Logic in Computer Science · Computer Science 2026-03-27 Luca Aceto , Antonis Achilleos , Aggeliki Chalki , Anna Ingolfsdottir

The subject is partial desingularization preserving the normal crossings singularities of an algebraic or analytic variety X (over the complex field or over an uncountable algebraically closed field of characteristic zero, in the algebraic…

Algebraic Geometry · Mathematics 2026-02-11 André Belotto da Silva , Edward Bierstone

Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…

Rings and Algebras · Mathematics 2020-07-15 Konrad Schrempf

Two of the most useful tools in topological combinatorics are the nerve lemma and discrete Morse theory. In this note we introduce a theorem that interpolates between them and allows decompositions of complexes into non-contractible pieces…

Combinatorics · Mathematics 2013-07-18 Alexander Engström