相关论文: Induced and non-induced forbidden subposet problem…

The dimension of a poset $P$, denoted $\dim(P)$, is the least positive integer $d$ for which $P$ is the intersection of $d$ linear extensions of $P$. The maximum dimension of a poset $P$ with $|P|\le 2n+1$ is $n$, provided $n\ge2$, and this…

Let $S\_{N}(P)$ be the poset obtained by adding a dummy vertex on each diagonal edge of the $N$'s of a finite poset $P$. We show that $S\_{N}(S\_{N}(P))$ is $N$-free. It follows that this poset is the smallest $N$-free barycentric…

Let $P$ be a partially ordered set. If the Boolean lattice $(2^{[n]},\subset)$ can be partitioned into copies of $P$ for some positive integer $n$, then $P$ must satisfy the following two trivial conditions: (1) the size of $P$ is a power…

Combined synchrotron angle-dispersive powder diffraction and micro-Raman spectroscopy are used to investigate the pressure-induced lattice instabilities that are accompanied by T$_{\rm c}$ anomalies in YBa$_{\rm 2}$Cu$_{\rm 4}$O$_{\rm 8}$,…

This paper establishes a precise high-dimensional asymptotic theory for boosting on separable data, taking statistical and computational perspectives. We consider a high-dimensional setting where the number of features (weak learners) $p$…

We consider the Poisson Boolean continuum percolation model in n-dimensional hyperbolic space. In 2 dimensions we show that there are intensities for the underlying Poisson process for which there are infinitely unbounded components in the…

We consider optimal stopping problems, in which a sequence of independent random variables is drawn from a known continuous density. The objective of such problems is to find a procedure which maximizes the expected reward; this is often…

Given two phylogenetic trees with the $\{1, \ldots, n\}$ leaf-set the maximum agreement subtree problem asks what is the maximum size of the subset $A \subseteq \{1, \ldots, n\}$ such that the two trees are equivalent when restricted to…

For a real c \geq 1 and an integer n, let f(n,c) denote the maximum integer f so that every graph on n vertices contains an induced subgraph on at least f vertices in which the maximum degree is at most c times the minimum degree. Thus, in…

This thesis is concerned with the asymptotic behavior of solutions of stochastic $p$-Laplace equations driven by non-autonomous forcing on $\mathbb{R}^n$. Two cases are studied, with additive and multiplicative noise respectively. Estimates…

A family $\mathcal{G}$ of sets is a(n induced) copy of a poset $P=(P,\leqslant)$ if there exists a bijection $b:P\rightarrow \mathcal{G}$ such that $p\leqslant q$ holds if and only if $b(p)\subseteq b(q)$. The induced saturation number…

We study theoretically the interference patterns produced by the overlap of an array of Bose-Einstein condensates that have no phase coherence among them. We show that density-density correlations at different quasimomenta, which play an…

The lattice size $\operatorname{ls_\Delta}(P)$ of a lattice polytope $P$ is a geometric invariant, which was formally introduced in relation to the problem of bounding the total degree and the bi-degree of the defining equation of an…

The problem of bounding the size of a set system under various intersection restrictions has a central place in extremal combinatorics. We investigate the maximum number of disjoint pairs a set system can have in this setting. In…

We investigate degenerate saddle point problems, which can be viewed as limit cases of standard mixed formulations of symmetric problems with large jumps in coefficients. We prove that they are well-posed in a standard norm despite the…

A sanity check rules out certain types of obviously false results, but does not catch every possible error. After reviewing such a sanity check for $NN$ bound states with the L\"uscher's finite volume formula[1-3], we give further evidences…

The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We…

Given posets $\mathbf{P}_1,\mathbf{P}_2,\ldots,\mathbf{P}_k$, let the {\em Boolean Ramsey number} $R(\mathbf{P}_1,\mathbf{P}_2,\ldots,\mathbf{P}_k)$ be the minimum number $n$ such that no matter how we color the elements in the Boolean…

We study the critical bosonic O(N) vector model with quenched random mass disorder in the large N limit. Due to the replicated action which is sometimes not bounded from below, we avoid the replica trick and adopt a traditional approach to…

For two posets $(P,\le_P)$ and $(P',\le_{P'})$, we say that $P'$ contains a copy of $P$ if there exists an injective function $f\colon P'\to P$ such that for every two $X,Y\in P$, $X\le_P Y$ if and only if $f(X)\le_{P'} f(Y)$. Given two…