Related papers: A separation theorem for simple theories
We develop a unified framework for nonlinear subdivision schemes on complete metric spaces (CMS). We begin with CMS preliminaries and formalize refinement in CMS, retaining key structural properties, such as locality. We prove a convergence…
The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…
We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part.…
A computational theory for clustering and a semi-supervised clustering algorithm is presented. Clustering is defined to be the obtainment of groupings of data such that each group contains no anomalies with respect to a chosen grouping…
Motivated by a real problem in steel production, we introduce and analyze a general class of singularly perturbed linear hybrid systems with both switches and impulses, in which the slow or fast nature of the variables can be…
We demonstrate that the necessary condition for $SO(N) \times SO(N)$ duality invariance manifests as a partial differential equation in two-dimensional scalar theories. This condition, expressed as a partial differential equation,…
Understanding minimal assumptions that enable learning and generalization is perhaps the central question of learning theory. Several celebrated results in statistical learning theory, such as the VC theorem and Littlestone's…
Whether listening to overlapping conversations in a crowded room or recording the simultaneous electrical activity of millions of neurons, the natural world abounds with sparse measurements of complex overlapping signals that arise from…
Conceptual models as representations of real-world systems are based on diverse techniques in various disciplines but lack a framework that provides multidisciplinary ontological understanding of real-world phenomena. Concurrently, systems…
In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…
We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…
Results are presented for the phase separation process of a binary mixture subject to an uniform shear flow quenched from a disordered to a homogeneous ordered phase. The kinetics of the process is described in the context of the…
Solving a decades-old problem we show that Keisler's 1967 order on theories has the maximum number of classes. The theories we build are simple unstable with no nontrivial forking, and reflect growth rates of sequences which may be thought…
We give a full solution to the question of existence of indiscernibles in dependent theories by proving the following theorem: for every $\theta$ there is a dependent theory $T$ of size $\theta$ such that for all $\kappa$ and $\delta$,…
For a first-order theory $T$, the Constraint Satisfaction Problem of $T$ is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of $T$. In this article we develop sufficient…
We present a method for constructing countable models of small theories and apply it to prove theorems on the maximal number of countable non-isomorphic models of linearly ordered theories.
Starting from the equations of Stokes flow and the mass conservation of particles as determined by shear-induced diffusion, we derive the coupled equations for the dynamics of particle concentration and film thickness for the free-surface…
We present a general central limit theorem with simple, easy-to-check covariance-based sufficient conditions for triangular arrays of random vectors when all variables could be interdependent. The result is constructed from Stein's method,…
This paper addresses the issues of conservativeness and computational complexity of probabilistic robustness analysis. We solve both issues by defining a new sampling strategy and robustness measure. The new measure is shown to be much less…
The scaling theory of irreversible aggregation is discussed in some detail. First, we review the general theory in the simplest case of binary reactions. We then extend consideration to ternary reactions, multispecies aggregation,…