Related papers: A microscopic approach to Souslin-tree constructio…
In Part II of this work, we construct crystallized polyiamonds with $h$ holes for every $h\ge1$, that is polyiamonds which use the fewest possible tiles necessary to enclose $h$ holes. Furthermore, we prove that crystallized polyiamonds…
This is the second in a series of two works which study the discrete Gaussian free field on the binary tree when all leaves are conditioned to be positive. In the first work ("Gaussian free field on the tree subject to a hard wall I:…
Structure constants of minimal conformal theories are reconsidered. It is shown that {\it ratios} of structure constants of spin zero fields of a non-diagonal theory over the same evaluated in the diagonal theory are given by a simple…
We investigate questions involving Aronszajn trees, square principles, and stationary reflection. We first consider two strengthenings of $\square(\kappa)$ introduced by Brodsky and Rinot for the purpose of constructing $\kappa$-Souslin…
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 consider a Brownian tree consisting of a collection of one-dimensional Brownian paths started from the origin, whose genealogical structure is given by the Continuum Random Tree (CRT). This Brownian tree may be generated from the…
Motivated by two open questions about two-cardinal tree properties, we introduce and study generalized narrow system properties. The first of these questions asks whether the strong tree property at a regular cardinal $\kappa \geq \omega_2$…
We present a novel fabrication procedure to produce high-quality lift-off structures on diamond anvils extending from the culet down to the slanted facets. Feature sizes down to 500 nm are achieved through the use of a bi-layer resist stack…
We introduce "chain by chain" method for constructing the constraint structure of a system possessing both first and second class constraints. We show that the whole constraints can be classified into completely irreducible first or second…
This paper solves a long standing open problem of whether NP-complete problems could be solved in polynomial time on a deterministic Turing machine by showing that the indistinguishable binomial decision tree can be formed in a 3-SAT…
Given a positive integer $n$, an $n$-ladder is a lower finite lattice whose elements have at most $n$ lower covers. In 1984, Ditor proved that every $n$-ladder has cardinality at most $\aleph_{n-1}$ and asked whether this bound is sharp,…
An $r$-augmented tree is a rooted tree plus $r$ edges added from each leaf to ancestors. For $d,g,r\in\mathbb{N}$, we construct a bipartite $r$-augmented complete $d$-ary tree having girth at least $g$. The height of such trees must grow…
This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…
We explicitly construct several Poisson structures with compact support. For example, we show that any Poisson structure on $\R^n$ with polynomial coefficients of degree at most two can be modified outside an open ball, such that it becomes…
Compactly supported shearlets have been studied in both theory and applications. In this paper, we construct symmetric compactly supported shearlet systems based on pseudo splines of type II. Specially, using B-splines, we construct…
Merger trees are routinely used to follow the growth and merging history of dark matter haloes and subhaloes in simulations of cosmic structure formation. Srisawat et al. (2013) compared a wide range of merger-tree-building codes. Here we…
The strong tree property and ITP (also called the super tree property) are generalizations of the tree property that characterize strong compactness and supercompactness up to inaccessibility. That is, an inaccessible cardinal $\kappa$ is…
A new large-cardinal property is introduced which enables one to give a relative consistency proof of restricted versions of the reflection principles discussed by Tait in his essay "Constructing Cardinals from Below".
Compatibility of unrooted phylogenetic trees is a well studied problem in phylogenetics. It asks to determine whether for a set of k input trees there exists a larger tree (called a supertree) that contains the topologies of all k input…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…