Related papers: A new model for all $C$-sequences are trivial

Tree-shaped graphical models are widely used for their tractability. However, they unfortunately lack expressive power as they require committing to a particular sparse dependency structure. We propose a novel class of generative models…

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

A well-known theorem of W. Fischer and H. Grauert states that analytic fiber spaces with all fibers isomorphic to a fixed compact connected complex manifold are locally trivial. Motivated by this result, we show that if $k$ is an…

Questions regarding the continuity in $\kappa$ of the $SLE_{\kappa}$ traces and maps appear very naturally in the study of SLE. In order to study the first question, we consider a natural coupling of SLE traces: for different values of…

Spin models are used in many studies of complex systems---be it condensed matter physics, neural networks, or economics---as they exhibit rich macroscopic behaviour despite their microscopic simplicity. Here we prove that all the physics of…

Let $\overline{M}$ be a smooth manifold with boundary $\partial M$ and interior $M$. Consider an affine connection $\nabla$ on $M$ for which the boundary is at infinity. Then $\nabla$ is projectively compact of order $\alpha$ if the…

For any set $X$, ${\mathcal P}(X)$ denotes the collection of all subsets of $X$, ordered by inclusion. A {\it cutset} in ${\mathcal P}(X)$ is a subset of ${\mathcal P}(X)$ which meets every maximal chain of ${\mathcal P}(X)$. A cutset is…

We introduce tree linear cascades, a class of linear structural equation models for which the error variables are uncorrelated but need not be Gaussian nor independent. We show that, in spite of this weak assumption, the tree structure of…

Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…

We consider an optimal transport problem with backward martingale constraint. The objective function is given by the scalar product of a pseudo-Euclidean space $S$. We show that the supremums over maps and plans coincide, provided that the…

It is well-known that coupling constraints in linear bilevel optimization can lead to disconnected feasible sets, which is not possible without coupling constraints. However, there is no difference between linear bilevel problems with and…

Starting from the existence of a weakly compact cardinal, we build a generic extension of the universe in which $GCH$ holds and all $\aleph_2$-Aronszajn trees are special and hence there are no $\aleph_2$-Souslin trees. This result answers…

For a fixed positive $\epsilon$, we show the existence of a constant $C_\epsilon$ with the following property: Given a $\pm1$-edge-labeling $c:E(K_n)\to \{ -1,1\}$ of the complete graph $K_n$ with $c(E(K_n))=0$, and a spanning forest $F$ of…

Suppose $(X_n)$ is a sequence of positive-dimensional smooth projective complete intersections over $\mathbb{F}_q$ with dimensions bounded from above and with characteristic zero lifts $(\tilde{X}_n)$ to smooth projective geometrically…

We investigate the question of when free structures of infinite rank (in a variety) possess model-theoretic properties like categoricity in higher power, saturation, or universality. Concentrating on left $R$-modules we show, among other…

Any finite dimensional semisimple algebra A over a field K is isomorphic to a direct sum of finite dimensional full matrix rings over suitable division rings. In this paper we will consider the special case where all division rings are…

Gauged linear sigma models with (0,2) supersymmetry allow a larger choice of couplings than models with (2,2) supersymmetry. We use this freedom to find a fully linear construction of torsional heterotic compactifications, including models…

Assuming an instance of the Brodsky-Rinot proxy principle holding at a regular uncountable cardinal $\kappa$, we construct $2^\kappa$-many pairwise non-embeddable minimal non-$\sigma$-scattered linear orders of size $\kappa$. In particular,…

We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and…

Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…