Related papers: Scales and the fine structure of K(R). Part I: Acc…

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Let M be a fine structural mouse. Let D be a fully backgrounded L[E]-construction computed inside an iterable coarse premouse S. We describe a process comparing M with D, through forming iteration trees on M and on S. We then prove that…

Let $Q$ be an ideal (downward-closed set) in the lattice of linear subspaces of $(\mathbb F_q)^n$, ordered by inclusion. For $0 \le k \le n$, let $\mu_k(Q)$ denote the fraction of $k$-dimensional subspaces that belong to $Q$. We show that…

It is shown that if there is a measurable cardinal above n Woodin cardinals and M_{n+1}^# doesn't exist then K exists. K is not fully iterable, though, but only iterable with respect to stacks of certain trees living between the Woodin…

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

The notion of degree-constrained spanning hierarchies, also called k-trails, was recently introduced in the context of network routing problems. They describe graphs that are homomorphic images of connected graphs of degree at most k. First…

The structure of the algebra K[M] of the Chinese monoid M over a field K is studied. The minimal prime ideals are described. They are determined by certain homogeneous congruences on M and they are in a one to one correspondence with…

The first part of this work uses the algorithm recently detailed in arXiv:1906.02935 to classify the irreducible weight modules of the minimal model vertex operator algebra $L_k(\mathfrak{sl}_3)$, when the level $k$ is admissible. These are…

We present a PSPACE algorithm that decides satisfiability of the graded modal logic Gr(K_R)---a natural extension of propositional modal logic K_R by counting expressions---which plays an important role in the area of knowledge…

A class K of structures is controlled if, for all cardinals lambda, the relation of L_{infty,lambda}-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that the class of doubly transitive…

Robust estimation is much more challenging in high dimensions than it is in one dimension: Most techniques either lead to intractable optimization problems or estimators that can tolerate only a tiny fraction of errors. Recent work in…

We provide the first mathematically complete derivation of the Nystr\"om method for low-rank approximation of indefinite kernels and propose an efficient method for finding an approximate eigendecomposition of such kernel matrices. Building…

Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a given semialgebraic set K. At this level of generality this…

We explore the integration of representations from a Lie algebra to its algebraic group in positive characteristic. An integrable module is stable under the twists by group elements. Our aim is to investigate cohomological obstructions for…

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the…

Our main result (Theorem 1) suggests a possible dividing line ($\mu$-superstable $+$ $\mu$-symmetric) for abstract elementary classes without using extra set-theoretic assumptions or tameness. This theorem illuminates the structural side of…

Let K be an abstract elementary class of models. Assume that there are less than the maximal number of models in K_{\lambda^{+n}} (namely models in K of power \lambda^{+n}) for all n. We provide conditions on K_\lambda, that imply the…

We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three…

Let $K$ be the number field determined by a monic irreducible polynomial $f(x)$ with integer coefficients. In previous papers we parameterized the prime ideals of $K$ in terms of certain invariants attached to Newton polygons of higher…