Related papers: General Non-structure Theory
We give a constructive proof of the Hodge conjecture for complex $K3$ surfaces that does not rely on Torelli-type results. Starting with an arbitrary rational $(1,1)$-class $\alpha\in H^{1,1}(X,\mathbb{Q})$, we algorithmically build a…
We prove some structure results for isometries between noncommutative Lp spaces associated to von Neumann algebras. We find that an isometry T: Lp(M_1) to Lp(M_2) (1 le p < infty, p not 2) can be canonically expressed in a certain simple…
We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…
This is the first in a series of papers that deals with duality statements such as Mukai-duality (T-duality, from algebraic geometry) and the Baum-Connes conjecture (from operator $K$-theory). These dualities are expressed in terms of…
Classes with bounded rankwidth are MSO-transductions of trees and classes with bounded linear rankwidth are MSO-transductions of paths -- a result that shows a strong link between the properties of these graph classes considered from the…
Let $K$ be an algebraic number field with ring of integers $\Cal{O}_{K}$, $p>2$ be a rational prime and $G$ be the cyclic group of order $p $. Let $\Lambda$ denote the order $\Cal{O}_{K}[G].$ Let $Cl(\Lambda)$ denote the locally free class…
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v_1, ..., v_k of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified…
In the classification of complete first-order theories, many dividing lines have been defined in order to understand the complexity and the behavior of some classes of theories. In this paper, using the concept of patterns of consistency…
Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…
A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…
The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…
Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…
Consider an a.e.c. (abstract elementary class), that is, a class K of models with a partial order refining inclusion (submodel) which satisfy the most basic properties of an elementary class. Our test question is trying to show that the…
It is known that for subgraph-closed graph classes the first-order model checking problem is fixed-parameter tractable if and only if the class is nowhere dense [Grohe, Kreutzer, Siebertz, STOC 2014]. However, the dependency on the formula…
Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of…
We prove basic facts about reflexivity in derived categories over noetherian schemes; and about related notions such as semidualizing complexes, invertible complexes, and Gorenstein-perfect maps. Also, we study a notion of rigidity with…
The aim of this paper is to study categorified algebraic structures and their pseudo- and lax homomorphisms using the framework of Lawvere $2$-theories, and more generally, (enhanced) $2$-dimensional sketches. The key notion we focus on is…
Two Lie algebroids are presented that are linked to the construction of the linearizing output of an affine in the input nonlinear system. The algorithmic construction of the linearizing output proceeds inductively, and each stage has two…
In this series of papers, we investigate properties of a finite group which are determined by its low degree irreducible representations over a number field $F$, i.e. its representations on matrix rings $\operatorname{M}_n(D)$ with $n \leq…
A tangle of order $k$ in a matroid or graph may be thought of as a "$k$-connected component". For a tangle of order $k$ in a matroid or graph that satisfies a certain robustness condition, we describe a tree decomposition of the matroid or…