Related papers: Covering n-Permutations with (n+1)-Permutations
Motivated by a question from a recent paper by Gilton, Levine and Stejskalova, we obtain a new characterization of the ideal $J[\kappa]$, from which we confirm that $\kappa$-Souslin trees exist in various models of interest. As a corollary…
We provide a model where u(\kappa) < 2^{\kappa} for a supercompact cardinal \kappa. Garti and Shelah have provided a sketch of how to obtain such a model by modifying the construction in a paper of Dzamonja and Shelah; we provide here a…
For $\Lambda$-$n$-coalescents with mutation, we analyse the size $O_n$ of the partition block of $i\in\{1,\ldots,n\}$ at the time where the first mutation appears on the tree that affects $i$ and is shared with any other…
Let $S_n$ be the set of permutations on $\{1,\,\dots,\,n\}$ and $\pi\in S_n$. Let $\mathrm{d}(\pi)$ be the arithmetic average of $\{|i-\pi(i)|;\;1\le i\le n\}$. Then $\mathrm{d}(\pi)/n\in[0,\,1/2]$, the expected value of $\mathrm{d}(\pi)/n$…
Superpermutations are words over a finite alphabet containing every permutation as a factor. Finding the minimal length of a superpermutation is still an open problem. In this article, we introduce superpermutations matrices. We establish a…
For a cardinal kappa and a model M of cardinality kappa let No(M) denote the number of non-isomorphic models of cardinality kappa which are L_{infty,kappa}--equivalent to M. In [Sh:133] Shelah established that when kappa is a weakly compact…
Usuba has asked whether the $\kappa$-mantle, the intersection of all grounds that extend to $V$ via a forcing of size ${<}\kappa$, is always a model of ZFC. We give a negative answers by constructing counterexamples where $\kappa$ is a…
The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing…
We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Omega(n/psi(n)) for some function psi(n)=omega(1) of the instance size. We design new…
An inaccessible cardinal kappa is supercompact when (kappa, lambda)-ITP holds for all lambda greater than or equal to kappa. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC…
We present an overview of results on the question of whether the non-stationary ideal of an uncountable regular cardinal $\kappa$ can be defined by a $\Pi_1$-formula using parameters of hereditary cardinality at most $\kappa$. These results…
For each natural number $n$, let $C^{(n)}$ be the closed and unbounded proper class of ordinals $\alpha$ such that $V_\alpha$ is a $\Sigma_n$ elementary substructure of $V$. We say that $\kappa$ is a \emph{$C^{(n)}$-cardinal} if it is the…
Recently, Kothari et al.\ gave an algorithm for testing the surface area of an arbitrary set $A \subset [0, 1]^n$. Specifically, they gave a randomized algorithm such that if $A$'s surface area is less than $S$ then the algorithm will…
What minimum degree of a graph $G$ on $n$ vertices guarantees that the union of $G$ and a random $2$-factor (or permutation) is with high probability Hamiltonian? Gir\~ao and Espuny D{\'\i}az showed that the answer lies in the interval…
Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We study some probabilistic and…
Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…
Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept of a generic point of a variety). To a countable first-order…
We show that $\mathrm{MA}_{\kappa}$ implies that each collection of ${P}_{\mathfrak c}$-points of size at most $\kappa$ which has a $P_{\mathfrak c}$-point as an $RK$ upper bound also has a ${P}_{\mathfrak c}$-point as an $RK$ lower bound.
Let kappa be an uncountable regular cardinal. Call an equivalence relation on functions from kappa into 2 Sigma_1^1-definable over H(kappa) if there is a first order sentence F and a parameter R subseteq H(kappa) such that functions…
Canon permutations are permutations of the multiset having $k$ copies of each integer between $1$ and $n$, with the property that the subsequences obtained by taking the $j$th copy of each entry, for each fixed $j$, are all the same. For…