Related papers: Alternating Parity Weak Sequencing

The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in…

Let $\mathbb N_0$ be the set of non-negative integers, and let $P(n,l)$ denote the set of all weak compositions of $n$ with $l$ parts, i.e., $P(n,l)=\{ (x_1,x_2,\dots, x_l)\in\mathbb N_0^l\ :\ x_1+x_2+\cdots+x_l=n\}$. For any element…

A weak deletion sequence is a sequence $(G_1,\ldots,G_n)$ of graphs so that for each $i\in[n-1]$ either $G_i$ is isomorphic to a subgraph of $G_{i+1}$, or vice versa: $G_{i+1}$ is isomorphic to a subgraph of $G_i$. We prove that determining…

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

A new class of rings, {\em the class of weakly left localizable rings}, is introduced. A ring $R$ is called {\em weakly left localizable} if each non-nilpotent element of $R$ is invertible in some left localization $S^{-1}R$ of the ring…

Let $G=(\mathbb Z/n\mathbb Z) \oplus (\mathbb Z/n\mathbb Z)$. Let $\mathsf {s}_{\leq k}(G)$ be the smallest integer $\ell$ such that every sequence of $\ell$ terms from $G$, with repetition allowed, has a nonempty zero-sum subsequence with…

Let $\mathcal{B}$ be a collection of rectangular parallelepipeds in $\mathbb{R}^3$ whose sides are parallel to the coordinate axes and such that $\mathcal{B}$ consists of parallelepipeds with side lengths of the form $s, 2^j s, t $, where…

In this work, we consider the sample complexity required for testing the monotonicity of distributions over partial orders. A distribution $p$ over a poset is monotone if, for any pair of domain elements $x$ and $y$ such that $x \preceq y$,…

We give a simple, elementary proof that a uniform algebra is weakly sequentially complete if and only if it is finite-dimensional.

Let $p > 155$ be a prime and let $G$ be a cyclic group of order $p$. Let $S$ be a minimal zero-sum sequence with elements over $G$, i.e., the sum of elements in $S$ is zero, but no proper nontrivial subsequence of $S$ has sum zero. We call…

Let $0 < \theta \leqslant 1$. A sequence of positive integers $(b_n)_{n=1}^\infty$ is called a weak greedy approximation of $\theta$ if $\sum_{n=1}^{\infty}1/b_n = \theta$. We introduce the weak greedy approximation algorithm (WGAA), which,…

The equidistant subsequence pattern matching problem is considered. Given a pattern string $P$ and a text string $T$, we say that $P$ is an \emph{equidistant subsequence} of $T$ if $P$ is a subsequence of the text such that consecutive…

For two given graphs $G$ and $F$, a graph $ H$ is said to be weakly $ (G, F) $-saturated if $H$ is a spanning subgraph of $ G$ which has no copy of $F$ as a subgraph and one can add all edges in $ E(G)\setminus E(H)$ to $ H$ in some order…

Let G be a connected reductive group defined over an algebraically closed field k of characteristic p > 0. The purpose of this paper is two-fold. First, when p is a good prime, we give a new proof of the ``order formula'' of D. Testerman…

We give a necessary and sufficient condition for that the support $\tau$-tilting poset of a finite dimensional algebra is isomorphic to the poset of symmetric group with weak order. Moreover we show that there are infinitely many finite…

We consider a class of weakly hyperbolic systems of first-order, nonlinear PDEs. Weak hyperbolicity means here that the principal symbol of the system has a crossing of eigenvalues, and is not uniformly diagonalizable. We prove the…

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

We define a natural lattice structure on all subsets of a finite root system that extends the weak order on the elements of the corresponding Coxeter group. For crystallographic root systems, we show that the subposet of this lattice…

We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…

We show that the weak value of any observable in pre- and post-selected states can be expressed as the sum of the average of the observable in the pre-selected state and an anomalous part. We argue that at a fundamental level the anomalous…