Related papers: Superhighness
The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…
Let $K$ be a number field with ring of integers $\mathbb{Z}_K$. We prove two asymptotic formulas connected with the distribution of irreducible elements in $\mathbb{Z}_K$. First, we estimate the maximum number of nonassociated irreducibles…
We use $\diamondsuit$ to construct, for every $\alpha\leq\omega_1$ a sequential countably compact topological group of sequential order $\alpha$. This establishes the independence of the existence of sequential countably compact non…
We summarize the known methods of producing a non-supercompact strongly compact cardinal and describe some new variants. Our Main Theorem shows how to apply these methods to many cardinals simultaneously and exactly control which cardinals…
We introduce a natural two-cardinal version of Bagaria's sequence of derived topologies on ordinals. We prove that for our sequence of two-cardinal derived topologies, limit points of sets can be characterized in terms of a new iterated…
We show that there is a low T-upper bound for the class of K-trivial sets, namely those which are weak from the point of view of algorithmic randomness. This result is a special case of a more general characterization of ideals in the…
We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…
We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any $\gamma>0$ and $k\ge3$, we show that asymptotically almost surely, every subgraph of the binomial random $k$-uniform hypergraph…
Thin Lie algebras are Lie algebras L, graded over the positive integers, with all homogeneous components of dimension at most two, and satisfying a more stringent but natural narrowness condition modeled on an analogous one for pro-p…
We study the sets that are computable from both halves of some (Martin-L\"of) random sequence, which we call \emph{$1/2$-bases}. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e.\…
Reid asked whether all convex-cocompact subgroups of mapping class groups are separable. Using a construction of Manning-Mj-Sageev, we give examples of separable convex-cocompact subgroups that are free of arbitrary finite rank, while prior…
A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…
The hypergraph jump problem and the study of Lagrangians of uniform hypergraphs are two classical areas of study in the extremal graph theory. In this paper, we refine the concept of jumps to strong jumps and consider the analogous problems…
Although algorithmic randomness with respect to various non-uniform computable measures is well-studied, little attention has been paid to algorithmic randomness with respect to computable \emph{trivial} measures, where a measure $\mu$ on…
In the paper we describe the class of principal quandles and show that connected quandles can be decomposed as a disjoint union of principal quandles. We also prove that simple affine quandles are finite and they can be characterized among…
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
In this paper, we introduce a strong property $(A)$ and we study the transfer of property $(A)$ and strong property $(A)$ in trivial ring extensions and amalgamated duplication of a ring along an ideal. We also exhibit a class of rings…
We study codensity monads $T$ induced by (mostly small, mostly dense) full subcategories $A \subset K$. These monads behave quite similarly, we show some connections with the Isbell duality, pro-finite objects and compact spaces. We prove…
An interesting open conjecture asks whether it is possible to walk to infinity along primes, where each term in the sequence has one digit more than the previous. We present different greedy models for prime walks to predict the long-time…
A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…