Related papers: Elementary submodels in infinite combinatorics
To understand the structure of a network, it can be useful to break it down into its constituent pieces. This is the approach taken in a multitude of successful network analysis methods, such as motif analysis. These methods require one to…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
We study properties of semi-elementary imsets and elementary imsets introduced by Studeny (2005). The rules of the semi-graphoid axiom (decomposition, weak union and contraction) for conditional independence statements can be translated…
Graphs are nowadays ubiquitous in the fields of signal processing and machine learning. As a tool used to express relationships between objects, graphs can be deployed to various ends: I) clustering of vertices, II) semi-supervised…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive…
We prove an elementary additive combinatorics inequality, which says that if $A$ is a subset of an Abelian group, which has, in some strong sense, large doubling, then the difference set A-A has a large subset, which has small doubling.
This the first of a series of articles dealing with abstract classification theory. The apparatus to assign systems of cardinal invariants to models of a first order theory (or determine its impossibility) is developed in [Sh:a]. It is…
In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…
We study the homomorphisms between scalar generalized Verma modules. We conjecture that any homomorphism between is composition of elementary homomorphisms. The purpose of this article is to show the conjecture is affirmative for many…
We use G\"odel's Dialectica interpretation to analyse Nash-Williams' elegant but non-constructive "minimal bad sequence" proof of Higman's Lemma. The result is a concise constructive proof of the lemma (for arbitrary decidable…
When teaching an elementary logic course to students who have a general scientific background but have never been exposed to logic, we have to face the problem that the notions of deduction rule and of derivation are completely new to them,…
In this paper, we prove a crucial theorem called Mirroring Theorem which affirms that given a collection of samples with enough information in it such that it can be classified into classes and subclasses then (i) There exists a mapping…
In this note, we initiate a study of the finite-dimensional representation theory of a class of algebras that correspond to noncommutative deformations of compact surfaces of arbitrary genus. Low dimensional representations are investigated…
We propose a new formulation of a vanishing theorem for surfaces. Although this vanishing theorem follows easily from the well-known Kawamata--Viehweg vanishing theorem, it turns out to be remarkably useful. In particular, it is sufficient…
A step-by-step presentation of the code for a small theorem prover introduces theorem-proving techniques. The programming language used is Standard ML. The prover operates on a sequent calculus formulation of first-order logic, which is…
In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…
We present the basic ideas of forms (a generalization of Ehresmann's sketches) and their theories and models, more explicitly than in previous expositions. Forms provide the ability to specify mathematical structures and data types in any…
Despite significant progress in post-hoc explanation methods for neural networks, many remain heuristic and lack provable guarantees. A key approach for obtaining explanations with provable guarantees is by identifying a cardinally-minimal…