English
Related papers

Related papers: Alternating Parity Weak Sequencing

200 papers

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

Combinatorics · Mathematics 2021-10-15 Bingchen Qian , Xin Wang , Gennian Ge

We prove the following result due to Hamidoune using an analytic approach. Suppose that A is a subset of a finite group G with |AA^{-1}| \leq (2-\varepsilon)|A|. Then there is a subgroup H of G and a set X of size O_\varepsilon(1) such that…

Classical Analysis and ODEs · Mathematics 2012-12-04 Tom Sanders

We study clones modulo minor homomorphisms, which are mappings from one clone to another preserving arities of operations and respecting permutation and identification of variables. Minor-equivalent clones satisfy the same sets of…

Rings and Algebras · Mathematics 2024-02-26 Albert Vucaj , Dmitriy Zhuk

We study the congruence lattice of the poset of regions of a hyperplane arrangement, with particular emphasis on the weak order on a finite Coxeter group. Our starting point is a theorem from a previous paper which gives a geometric…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

For subsets $X,Y$ of a finite group $G$, let $Pr(X,Y)$ denote the probability that two random elements $x\in X$ and $y\in Y$ commute. Obviously, a finite group $G$ is nilpotent if and only if $Pr(P,Q)=1$ whenever $P$ and $Q$ are Sylow…

Group Theory · Mathematics 2023-11-20 Eloisa Detomi , Andrea Lucchini , Marta Morigi , Pavel Shumyatsky

This paper develops several average-case reduction techniques to show new hardness results for three central high-dimensional statistics problems, implying a statistical-computational gap induced by robustness, a detection-recovery gap and…

Computational Complexity · Computer Science 2020-05-20 Matthew Brennan , Guy Bresler

Let $X$ be an $n$-element set, where $n$ is even. We refute a conjecture of J. Gordon and Y. Teplitskaya, according to which, for every maximal intersecting family $\mathcal{F}$ of $\frac{n}2$-element subsets of $X$, one can partition $X$…

Combinatorics · Mathematics 2021-01-20 Peter Frankl , Janos Pach

Let $G$ be a finite group and $f:G \to {\mathbb C}$ be a function. For a non-empty finite subset $Y\subset G$, let $I_Y(f)$ denote the average of $f$ over $Y$. Then, $I_G(f)$ is the average of $f$ over $G$. Using the decomposition of $f$…

Combinatorics · Mathematics 2020-07-23 Hiroki Kajiura , Makoto Matsumoto , Takayuki Okuda

A subfamily $\mathcal{G}\subseteq \mathcal{F}\subseteq 2^{[n]}$ of sets is a non-induced (weak) copy of a poset $P$ in $\mathcal{F}$ if there exists a bijection $i:P\rightarrow \mathcal{G}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$.…

Combinatorics · Mathematics 2022-07-27 Balázs Keszegh , Nathan Lemons , Ryan R. Martin , Dömötör Pálvölgyi , Balázs Patkós

For $E \subset \mathbb{N}$, a subset $R \subset \mathbb{N}$ is $E$-intersective if for every $A \subset E$ having positive upper relative density, we have $R \cap (A - A) \neq \varnothing$. On the other hand, $R$ is chromatically…

Number Theory · Mathematics 2024-01-17 Pierre-Yves Bienvenu , John T. Griesmer , Anh N. Le , Thái Hoàng Lê

In this thesis, we present quantitative Ramsey-type results in the setting of finite sets that are equipped with a partial order, so-called posets. A prominent example of a poset is the Boolean lattice $Q_n$, which consists of all subsets…

Combinatorics · Mathematics 2024-09-16 Christian Winter

We study long chains of iterated weak* derived sets, that is sets of all weak* limits of bounded nets, of subspaces with the additional property that the penultimate weak* derived set is a proper norm dense subspace of the dual. We extend…

Functional Analysis · Mathematics 2024-08-05 Zdeněk Silber

We define here the notion of a {\it weakly reversible ring} $R$ saying that a non-zero element $a\in R$ is weakly reversible if there exists an integer $m>0$ depending on $a$ such that $a^m\neq 0$ is reversible, that is,…

Rings and Algebras · Mathematics 2025-04-28 Peter Danchev , M. Zahiri

We define the class of weakly approximately divisible unital C*-algebras and show that this class is closed under direct sums, direct limits, any tensor product with any C*-algebra, and quotients. A nuclear C*-algebra is weakly…

Operator Algebras · Mathematics 2019-02-20 Don Hadwin , Weihua Li

We say that a set $A$ \emph{$t$-intersects} a set $B$ if $A$ and $B$ have at least $t$ common elements. Two families $\mathcal{A}$ and $\mathcal{B}$ are said to be \emph{cross-$t$-intersecting} if each set in $\mathcal{A}$ $t$-intersects…

Combinatorics · Mathematics 2013-12-12 Peter Borg

For each fully commutative permutation, we construct a "boolean core," which is the maximal boolean permutation in its principal order ideal under the right weak order. We partition the set of fully commutative permutations into the…

Combinatorics · Mathematics 2022-12-12 Emily Gunawan , Jianping Pan , Heather M. Russell , Bridget Eileen Tenner

In this paper, we prove the following "Weak Bounded Negativity Conjecture", which says that given a complex smooth projective surface $X$, for any reduced curve $C$ in $X$ and integer $g$, assume that the geometric genus of each component…

Algebraic Geometry · Mathematics 2017-09-01 Feng Hao

Algebra bundles, in the strict sense, appear in many areas of geometry and physics. However, the structure of an algebra is flexible enough to vary non-trivially over a connected base, giving rise to a structure of a weak algebra bundle. We…

Algebraic Geometry · Mathematics 2018-11-26 Clarisson Rizzie Canlubo

Let $\mathfrak{S}_n$ and $\mathfrak{B}_n$ denote the respective sets of ordinary and bigrassmannian (BG) permutations of order $n$, and let $(\mathfrak{S}_n,\leq)$ denote the Bruhat ordering permutation poset. We study the restricted poset…

Combinatorics · Mathematics 2018-03-02 John Engbers , Adam Hammett

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

Combinatorics · Mathematics 2018-09-11 Jacob Hicks , M. A. Ollis , John. R. Schmitt