Related papers: The Seed Order
We study types that appear in ultraproducts that have distributions which can be thought of as a sequence of graphs. The property of having distributions that are captured by graphs is motivated by a commonality of $\mathrm{SOP}_2$-types…
In this paper, we characterize completely the structure of Clifford semigroups of matrices over an arbitrary field. It is shown that a semigroups of matrices of finite order is a Clifford semigroup if and only if it is isomorphic to a…
A fundamental task underlying many important optimization problems, from influence maximization to sensor placement to content recommendation, is to select the optimal group of $k$ items from a larger set. Submodularity has been very…
We continue our study of the class $\mathscr{C}(D)$, where $D$ is a uniform ultrafilter on a cardinal $\kappa$ and $\mathscr{C}(D)$ is the class of all pairs $(\theta_1, \theta_2),$ where $(\theta_1, \theta_2)$ is the cofinality of a cut in…
We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $\mathcal J$ of intervals of some totally ordered abelian group, these…
We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…
In the 1990s, Steel and Woodin showed that under large cardinal hypotheses, the HOD of $L(\mathbb R)$ admits a fine-structural analysis. Although this theorem sheds light on various problems in descriptive set theory, the fine-structural…
We consider linear orders of finite alternatives constructed by aggregating individual preferences. Specifically, we focus on linear orders that respect modified collective preference relations derived from supermajority rules, where…
We investigate sigma-entangled linear orders and narrowness of Boolean algebras. We show existence of sigma-entangled linear orders in many cardinals, and we build Boolean algebras with neither large chains nor large pies. We study the…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…
Temporal Ensembling is a semi-supervised approach that allows training deep neural network models with a small number of labeled images. In this paper, we present our preliminary study on the effect of intraclass variability on temporal…
Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
In this paper we develop a theory of monomial preorders, which differ from the classical notion of monomial orders in that they allow ties between monomials. Since for monomial preorders, the leading ideal is less degenerate than for…
Random forests are among the most famous algorithms for solving classification problems, in particular for large-scale data sets. Considering a set of labeled points and several decision trees, the method takes the majority vote to classify…
We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the…
It is proved to be consistent relative to a measurable cardinal that there is a uniform ultrafilter on the real numbers which is generated by fewer than the maximum possible number of sets. It is also shown to be consistent relative to a…
It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…
An ultraproduct can be a helpful organizing principle in presenting solutions of problems at many levels, as argued by Terence Tao. We apply it here to the solution of a calculus problem: every infinite sequence has a monotone infinite…