中文
相关论文

相关论文: Forbidden hypermatrices imply general bounds on in…

200 篇论文

Here we deal with some problems posed by Matet. The first section deals with the existence of stationary subsets of [lambda]^{<kappa} with no unbounded subsets which are not stationary, where, of course, kappa is regular uncountable less or…

逻辑 · 数学 2007-05-23 Saharon Shelah

We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains the standard example of dimension $k$ as a subposet. This applies in particular to posets whose cover graphs have bounded treewidth, as the…

组合数学 · 数学 2025-10-21 Gwenaël Joret , Piotr Micek , Michał Pilipczuk , Bartosz Walczak

In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…

离散数学 · 计算机科学 2024-08-14 Khaled Elbassioni

A $0$-$1$ matrix $M$ is saturating for a $0$-$1$ matrix $P$ if $M$ does not contain a submatrix that can be turned into $P$ by changing some $1$ entries to $0$ entries, and changing an arbitrary $0$ to $1$ in $M$ introduces such a submatrix…

组合数学 · 数学 2023-10-05 Radoslav Fulek , Balázs Keszegh

A balanced pattern of order $2d$ is an element $P \in \{+,-\}^{2d}$, where both signs appear $d$ times. Two sets $A,B \subset [n]$ form $P$-pattern, which we denote by $\operatorname{pat}(A,B) = P$, if $A\triangle B = \{j_1,\ldots…

组合数学 · 数学 2015-10-20 Ilan Karpas , Eoin Long

Balogh and Bollob\'as [{\em Combinatorica 25, 2005}] prove that for any $k$ there is a constant $f(k)$ such that any set system with at least $f(k)$ sets reduces to a $k$-star, an $k$-costar or an $k$-chain. They proved $f(k)<(2k)^{2^k}$.…

组合数学 · 数学 2014-09-30 Richard P. Anstee , Linyuan Lu

Alon and Shapira proved that every monotone class (closed under taking subgraphs) of undirected graphs is strongly testable, that is, under the promise that a given graph is either in the class or $\varepsilon$-far from it, there is a test…

组合数学 · 数学 2024-09-25 Panna Tímea Fekete , Gábor Kun

We prove a conjecture of Bonamy, Bousquet, Pilipczuk, Rz\k{a}\.zewski, Thomass\'e, and Walczak, that for every graph $H$, there is a polynomial $p$ such that for every positive integer $s$, every graph of average degree at least $p(s)$…

组合数学 · 数学 2024-09-30 Romain Bourneuf , Matija Bucić , Linda Cook , James Davies

We prove that there exist infinitely many coprime numbers $a$, $b$, $c$ with $a+b=c$ and $c>\operatorname{rad}(abc)\exp(6.563\sqrt{\log c}/\log\log c)$. These are the most extremal examples currently known in the $abc$ conjecture, thereby…

数论 · 数学 2024-06-05 Curtis Bright

We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…

组合数学 · 数学 2023-11-03 David Conlon , Jacob Fox , Huy Tuan Pham

Let $\mathcal{C}$ be a small, connected category with finite hom-sets. We show that if the embedding of a connected subcategory $\mathcal{J}$ is both initial and final, then the restriction of any $\mathcal{C}$-module along $\mathcal{J}$…

表示论 · 数学 2026-04-14 Thomas Brüstle , Justin Desrochers , Samuel Leblanc

Let $n$ be a positive integer, let $0<p\leqslant p'\leqslant \frac{1}{2}$, and let $\ell \leqslant pn$ be a nonnegative integer. We prove that if $\mathcal{F},\mathcal{G}\subseteq \{0,1\}^n$ are two families whose cross intersections forbid…

组合数学 · 数学 2025-07-02 Pandelis Dodos , Miltiadis Karamanlis

Stable subgroups and the Morse boundary are two systematic approaches to collect and study the hyperbolic aspects of finitely generated groups. In this paper we unify and generalize these strategies by viewing any geodesic metric space as a…

度量几何 · 数学 2017-06-14 Matthew Cordes , David Hume

In 2022, Holmsen showed that any graph with at least \( c \binom{n}{r} \) \(r\)-cliques but no induced complete $r$-partite graph $K_{2,\ldots, 2}$ must contain a clique of order \(\Omega(c^{2^{r-1}} n)\). In this paper, we study graphs…

组合数学 · 数学 2025-11-18 Nannan Chen , Yulai Ma , Fan Yang

Saturation problems for forbidden graphs have been a popular area of research for many decades, and recently Brualdi and Cao initiated the study of a saturation problem for 0-1 matrices. We say that 0-1 matrix $A$ is saturating for the…

组合数学 · 数学 2020-12-29 Jesse Geneson

An $r$-matrix is a matrix with symbols in $\{0,1,\dots,r-1\}$. A matrix is simple if it has no repeated columns. Let the support of a matrix $F$, $\text{supp}(F)$ be the largest simple matrix such that every column in $\text{supp}(F)$ is in…

组合数学 · 数学 2019-12-23 Keaton Ellis , Baian Liu , Attila Sali

In a recent article, Ch\'avez, Garcia and Hurley introduced a new family of norms $\|\cdot\|_{\mathbf{X},d}$ on the space of $n \times n$ complex matrices which are induced by random vectors $\mathbf{X}$ having finite $d$-moments. Therein,…

度量几何 · 数学 2024-02-14 Ludovick Bouthat

We prove a Freiman--Ruzsa-type theorem with polynomial bounds in arbitrary abelian groups with bounded torsion, thereby proving (in full generality) a conjecture of Marton. Specifically, let $G$ be an abelian group of torsion $m$ (meaning…

数论 · 数学 2024-05-22 W. T. Gowers , Ben Green , Freddie Manners , Terence Tao

Our motivating question was whether all traces on a U-ultrapower of a C*-algebra A, where U is a non-principal ultrafilter on N, are necessarily U-limits of traces on A. We show that this is false so long as A has infinitely many extremal…

算子代数 · 数学 2017-02-10 Tristan Bice , Ilijas Farah

Given a finite poset $\mathcal P$, we call a family $\mathcal F$ of subsets of $[n]$ $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced copy…

组合数学 · 数学 2020-05-29 Maria-Romina Ivan