Related papers: Elementary submodels in infinite combinatorics

We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…

We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…

We report about significant enhancements of the complex algebraic geometry theorem proving subsystem in GeoGebra for automated proofs in Euclidean geometry, concerning the extension of numerous GeoGebra tools with proof capabilities. As a…

In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz by using multi-Schur…

The book "A Course in Constructive Algebra" (1988) shows the way of understanding classical basic algebra in a constructive style similar to Bishop's Constructive Mathematics. Classical theorems are revisited, with a new flavour, and become…

The first aim of this note is to give a concise, but complete and self-contained, presentation of the fundamental theorems of Mori theory - the nonvanishing, base point free, rationality and cone theorems - using modern methods of…

We present a type inference algorithm for lambda-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.

For neural models to garner widespread public trust and ensure fairness, we must have human-intelligible explanations for their predictions. Recently, an increasing number of works focus on explaining the predictions of neural models in…

Subatomic systems were recently introduced to identify the structural principles underpinning the normalization of proofs. "Subatomic" means that we can reformulate logical systems in accordance with two principles. Their atomic formulas…

We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…

Algorithmic meta-theorems are general algorithmic results applying to a whole range of problems, rather than just to a single problem alone. They often have a "logical" and a "structural" component, that is they are results of the form:…

Isabelle is a generic theorem prover, designed for interactive reasoning in a variety of formal theories. At present it provides useful proof procedures for Constructive Type Theory, various first-order logics, Zermelo-Fraenkel set theory,…

A mathematics student's first introduction to the fundamental theorem of finite fields (FTFF) often occurs in an advanced abstract algebra course and invokes the power of Galois theory to prove it. Yet the combinatorial and algebraic coding…

We present an extension of the classical theory of calculus of variations to generalized functions. The framework is the category of generalized smooth functions, which includes Schwartz distributions while sharing many nonlinear properties…

With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic…

We investigate uniform ergodic type theorems for additive and subadditive functions on a subshift over a finite alphabet. We show that every strictly ergodic subshift admits a uniform ergodic theorem for Banach-space-valued additive…

Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…

The goal of invariant theory is to find all the generators for the algebra of representations of a group that leave the group invariant. Such generators will be called \emph{basic invariants}. In particular, we set out to find the set of…

Colimits are a fundamental construction in category theory. They provide a way to construct new objects by gluing together existing objects that are related in some way. We introduce a complementary notion of anticolimits, which provide a…

We develop a model of abduction in abstract argumentation, where changes to an argumentation framework act as hypotheses to explain the support of an observation. We present dialogical proof theories for the main decision problems (i.e.,…