Related papers: The uniqueness of the core model
Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…
While many inner model theoretic combinatorial principles are incompatible with large cardinal axioms, on some rare occasions, large cardinals actually imply that the structure of the universe of sets is analogous to the canonical inner…
The thesis presents the subject of synthetic topology, especially with relation to metric spaces. A model of synthetic topology is a categorical model in which objects possess an intrinsic topology in a suitable sense, and all morphisms are…
Furstenberg, using tools from topological dynamics, defined the notion of a central subset of positive integers, and proved a powerful combinatorial theorem about such sets. Using the algebraic structure of the Stone-\v{C}ech…
In optimization or machine learning problems we are given a set of items, usually points in some metric space, and the goal is to minimize or maximize an objective function over some space of candidate solutions. For example, in clustering…
The richness and very high accuracy of the observed frequencies of solar oscillations provide tight constraints on the structure of the solar interior and hence on the assumptions underlying the calculation of solar models. This permits the…
We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…
The Entity-Component-System (ECS) software design pattern, long used in game development, encourages a clean separation of identity (entities), data properties (components), and computational behaviors (systems). Programs written using the…
Modern single-cell flow and mass cytometry technologies measure the expression of several proteins of the individual cells within a blood or tissue sample. Each profiled biological sample is thus represented by a set of hundreds of…
A coreset (or core-set) of an input set is its small summation, such that solving a problem on the coreset as its input, provably yields the same result as solving the same problem on the original (full) set, for a given family of problems…
This paper lays down the research agenda for a domain-specific foundation model for operating systems (OSes). Our case for a foundation model revolves around the observations that several OS components such as CPU, memory, and network…
A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…
The purpose of this article is to indicate how a reformulation of Jensen's $\Sigma^*$ theory (developed for the study of core models) can be used to provide a more satisfactory treatment of uniformization, hulls and Skolem functions for the…
Is it possible to understand the intricacies of a dynamical system not solely from its input/output pattern, but also by observing the behavior of other systems within the same class? This central question drives the study presented in this…
We consider a metapopulation version of the Schelling model of segregation over several complex networks and lattice. We show that the segregation process is topology independent and hence it is intrinsic to the individual tolerance. The…
John Steel's theory, MV, of the generic multiverse provides a foundation for mathematics that aims to neutralize the effects of incompleteness brought on by forcing arguments. Jouko V\"a\"an\"anen's development of internal categoricity…
How many words are needed to define all the words in a dictionary? Graph-theoretic analysis reveals that about 10% of a dictionary is a unique Kernel of words that define one another and all the rest, but this is not the smallest such…
A criterion is given for a type in a finite rank stable theory to be (almost) internal to a given nonmodular minimal type. The motivation comes from results of Campana which give criteria for compact complex analytic spaces to be algebraic…
Forking is a central notion of model theory, generalizing linear independence in vector spaces and algebraic independence in fields. We develop the theory of forking in abstract, category-theoretic terms, for reasons both practical (we…
The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…