Related papers: A new model for all $C$-sequences are trivial
We present a framework to define a large class of neural networks for which, by construction, training by gradient flow provably reaches arbitrarily low loss when the number of parameters grows. Distinct from the fixed-space global…
We show it is consistent that there is a Souslin tree $S$ such that after forcing with $S$, $S$ is Kurepa and for all clubs $C \subset \omega_1$, $S\upharpoonright C$ is rigid. This answers Fuchs's questions in Club degrees of rigidity and…
We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even if we allow epsilon-contractions and reachability predicates (with regular constraints) for pairs of configurations, the structures remain…
In this paper we show that the Matsushita model structure on loop graphs, which is right-transferred from the Kan-Quillen model structure on simplicial sets, factors through two other right-transferred model structures on simplicial…
We consider the $s$-$t$-path TSP: given a finite metric space with two elements $s$ and $t$, we look for a path from $s$ to $t$ that contains all the elements and has minimum total distance. We improve the approximation ratio for this…
We show that the tree property, stationary reflection and the failure of approachability at $\kappa^{++}$ are consistent with $\mathfrak{u}(\kappa) = \kappa^+ < 2^\kappa$, where $\kappa$ is a singular strong limit cardinal with the…
Assuming the existence of a supercompact cardinal, we construct a model where, for some uncountable regular cardinal $\kappa$, there are no $\Sigma^1_1(\kappa)-\kappa-$mad families.
If $\kappa$ is regular and $2^{<\kappa}\leq\kappa^+$, then the existence of a weakly presaturated ideal on $\kappa^+$ implies $\square^*_\kappa$. This partially answers a question of Foreman and Magidor about the approachability ideal on…
In 1983 Kalai proved an incredible generalisation of Cayley's formula for the number of trees on a labelled vertex set to a formula for a class of $r$-dimensional simplicial complexes. These simplicial complexes generalise trees by means of…
We build on a recently proposed method for explaining solutions of constraint satisfaction problems. An explanation here is a sequence of simple inference steps, where the simplicity of an inference step is measured by the number and types…
We construct a large family of normal $\kappa$-complete $\mathbb{R}_\kappa$-embeddable non-special $\kappa^+$-Aronszajn trees which have no club isomorphic subtrees using an instance of the proxy principle of Brodsky-Rinot.
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
We describe the extension of normal iteration strategies with appropriate condensation properties to strategies for stacks of normal trees, with full normalization. Given a regular uncountable cardinal $\Omega$ and an…
For each cardinal $\kappa$, each natural number $n$ and each simplicial complex $K$ we construct a space $\nu^n_\kappa(K)$ and a map $\pi \colon \nu^n_\kappa(K) \to K$ such that the following conditions are satisfied. 1. $\nu^n_\kappa(K)$…
For $f,g\in\omega^\omega$ let $c^\forall_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e., for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. Let…
We investigate the unbalanced ordinary partition relations of the form $\lambda \rightarrow {(\lambda, \alpha)}^{2}$ for various values of the cardinal $\lambda$ and the ordinal $\alpha$. For example, we show that for every infinite…
We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely…
We give an explicit formula for all tree amplitudes in N=4 SYM, derived by solving the recently presented supersymmetric tree-level recursion relations. The result is given in a compact, manifestly supersymmetric form and we show how to…
We introduce a variant of the Kurepa family. We then use one such family to construct a ccc indestructible property associated with a complete coherent Suslin tree $S$. Moreover, in every ccc forcing extension that preserves Suslin of $S$,…
A new class of semi-implicit numerical schemes for linear advection equation on Cartesian grids is derived that is inspired by so-called $\kappa$-schemes used with fully explicit discretizations for this type of problems. Opposite to fully…