Related papers: On the uniqueness property of forking in abstract …

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…

We prove a duality principle for a special class of submanifolds in pseudo-Euclidean spaces. This class of submanifolds with potential of normals is introduced in this paper. We prove also, for example, that an arbitrary Frobenius manifold…

We investigate the geometry of forking for U-rank 2 elements in supersimple w-categorical theories and prove stable forking and some structural properties for such elements. We extend this analysis to the case of U-rank 3 elements.

We prove that for any finite-dimensional differential graded algebra with separable semisimple part the category of perfect modules is equivalent to a full subcategory of the category of perfect complexes on a smooth projective scheme with…

The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc. However, these quasirandomness variants have…

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…

This paper is a contribution to "neo-stability" type of result for abstract elementary classes. Under certain set theoretic assumptions, we propose a definition and a characterization of NIP in AECs. The class of AECs with NIP properly…

We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…

The results in this paper are in a context of abstract elementary classes identified by Shelah and Villaveces in which the amalgamation property is not assumed. The long-term goal is to solve Shelah's Categoricity Conjecture in this…

For a semisimple multiring category with left duals, we prove that the unit object is simple if and only if the tensor functors by any non-zero algebra are separable (resp. faithful, resp. Maschke, resp. dual Maschke, resp. conservative).…

In the framework of graphs, we study abstract elementary classes (aecs). In this work we analyze several properties of Forb(G) and versions of Forb-Con(G) in the context of aecs and we present some examples of classes of graphs which…

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

We show that Zilber's conjecture that complex exponentiation is isomorphic to his pseudo-exponentiation follows from the a priori simpler conjecture that they are elementarily equivalent. An analysis of the first-order types in…

In this paper, we study a stability transfer theorem in d-tame Metric Abstract Elementary classes, in a similar way as in [BaKuVa], but using superstability-like assumptions which involves a new independence notion (Tame Independence)…

L. Soukup formulated an abstract framework in his introductory paper for proving theorems about uncountable graphs by subdividing them by an increasing continuous chain of elementary submodels. The applicability of this method relies on the…

We present a notion of $\Delta$-stability and stability filtration in arbitrary categories which is equivalent to the existence of Harder-Narasimhan (HN) sequences on objects. Indeed it is equivalent to the existence of a zero morphism, a…

Recently, Buan and Marsh showed that if two complete $\tau$-exceptional sequences agree in all but at most one term, then they must agree everywhere, provided the algebra is $\tau$-tilting finite. They conjectured that the result holds…

Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…

We generalize P. M. Neumann's Lemma to the setting of isometric actions on metric spaces and use it to prove several results in continuous logic related to algebraic independence. In particular, we show that algebraic independence satisfies…

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…