中文
相关论文

相关论文: The largest projective cube-free subsets of $\math…

200 篇论文

A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minimal) binary solutions to a linear equation (resp., inequality)…

组合数学 · 数学 2018-05-29 Endre Boros , Vladimir Gurvich , Martin Milanič

Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz proved in a landmark article that, for any positive integer $k$, up to isomorphism there are only finitely many maximal intersecting families of $k-$sets (maximal $k-$cliques). So they posed the…

组合数学 · 数学 2014-03-03 Kaushik Majumder

We consider tilings and packings of $\RR^d$ by integral translates of cubes $[0,2[^d$, which are $4\ZZ^d$-periodic. Such cube packings can be described by cliques of an associated graph, which allow us to classify them in dimension $d\leq…

组合数学 · 数学 2007-05-23 Mathieu Dutour , Yoshiaki Itoh , Alexei Poyarkov

For two families $\mathcal{A}, \mathcal{B} \subseteq \mathcal{P}([k])$, we write $\mathcal{A}\vdash\mathcal{B}$ if $A\not\supseteq B$ for each two sets $A \in \mathcal{A}$ and $B \in \mathcal{B}$. $\mathcal{A}$ and $\mathcal{B}$ are called…

组合数学 · 数学 2025-08-08 Maximilian Krone

A connected graph $G$ with at least $2m+2n+2$ vertices is said to have property $E(m,n)$ if, for any two disjoint matchings $M$ and $N$ of size $m$ and $n$ respectively, $G$ has a perfect matching $F$ such that $M\subseteq F$ and $N\cap…

组合数学 · 数学 2010-02-04 Qiuli Li , Heping Zhang

We show that an idempotent variety has a $d$-dimensional cube term if and only if its free algebra on two generators has no $d$-ary compatible cross. We employ Hall's Marriage Theorem to show that a variety of finite signature whose…

环与代数 · 数学 2016-09-12 Keith A. Kearnes , Agnes Szendrei

Let $A,B \subseteq \mathbb{R}^d $ both span $\mathbb{R}^d$ such that $\langle a, b \rangle \in \{0,1\}$ holds for all $a \in A$, $b \in B$. We show that $ |A| \cdot |B| \le (d+1) 2^d $. This allows us to settle a conjecture by Bohn, Faenza,…

组合数学 · 数学 2020-08-18 Andrey Kupavskii , Stefan Weltge

For fixed $d\geq 3$, we construct subsets of the $d$-dimensional lattice cube $[n]^d$ of size $n^{\frac{3}{d + 1} - o(1)}$ with no $d+2$ points on a sphere or a hyperplane. This improves the previously best known bound of…

组合数学 · 数学 2024-12-05 Andrew Suk , Ethan Patrick White

We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of d-regular graphs. For independent sets, this theorem is a strengthening of the results of Kahn, Galvin and Tetali, and Zhao showing…

组合数学 · 数学 2019-11-04 Ewan Davies , Matthew Jenssen , Will Perkins , Barnaby Roberts

For various triple systems $F$, we give tight lower bounds on the number of copies of $F$ in a triple system with a prescribed number of vertices and edges. These are the first such results for hypergraphs, and extend earlier theorems of…

组合数学 · 数学 2009-05-14 Dhruv Mubayi

A classic result of Erd\H{o}s and, independently, of Bondy and Simonovits says that the maximum number of edges in an $n$-vertex graph not containing $C_{2k}$, the cycle of length $2k$, is $O( n^{1+1/k})$. Simonovits established a…

组合数学 · 数学 2020-09-16 Tao Jiang , Liana Yepremyan

For a property $\Gamma$ and a family of sets $\cF$, let $f(\cF,\Gamma)$ be the size of the largest subfamily of $\cF$ having property $\Gamma$. For a positive integer $m$, let $f(m,\Gamma)$ be the minimum of $f(\cF,\Gamma)$ over all…

组合数学 · 数学 2010-12-20 János Barát , Zoltán Füredi , Ida Kantor , Younjin Kim , Balázs Patkós

Given an integral $d \times n$ matrix $A$, the well-studied affine semigroup $\mbox{ Sg} (A)=\{ b : Ax=b, \ x \in {\mathbb Z}^n, x \geq 0\}$ can be stratified by the number of lattice points inside the parametric polyhedra $P_A(b)=\{x:…

组合数学 · 数学 2015-07-27 Iskander Aliev , Jesus A. De Loera , Quentin Louveaux

The main purpose of this paper is to classify exchange relation planar algebras with 4 dimensional 2-boxes. Besides its skein theory, we emphasize the positivity of subfactor planar algebras based on the Schur product theorem. We will…

算子代数 · 数学 2016-05-26 Zhengwei Liu

First we consider families in the hypercube $Q_n$ with bounded VC dimension. Frankl raised the problem of estimating the number $m(n,k)$ of maximal families of VC dimension $k$. Alon, Moran and Yehudayoff showed that…

组合数学 · 数学 2017-10-25 Jozsef Balogh , Tamas Meszaros , Adam Zsolt Wagner

It is shown that two$(1 + 1)$-dimensional (2D) free Abelian- and self-interacting non-Abelian gauge theories (without any interaction with matter fields) belong to a new class of topological field theories. These new theories capture…

高能物理 - 理论 · 物理学 2016-09-06 R. P. Malik

We give an upper bound for the maximum number of edges in an $n$-vertex 2-connected $r$-uniform hypergraph with no Berge cycle of length $k$ or greater, where $n\geq k \geq 4r\geq 12$. For $n$ large with respect to $r$ and $k$, this bound…

组合数学 · 数学 2019-02-04 Zoltan Furedi , Alexandr Kostochka , Ruth Luo

We show that for any set $A \subset \mathbb{N}$ with positive upper density and any $\ell,m \in \mathbb{N}$, there exist an infinite set $B\subset \mathbb{N}$ and some $t\in \mathbb{N}$ so that $\{mb_1 + \ell b_2 \colon b_1,b_2\in B\…

动力系统 · 数学 2026-01-21 Ioannis Kousek

Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz established by means of an example that there exists a maximal intersecting family of $k-$sets with approximately $(e-1)k!$ blocks. L\'{a}szl\'{o} Lov\'{a}sz conjectured that their example is…

组合数学 · 数学 2015-01-12 Kaushik Majumder , Satyaki Mukherjee

Let $F_{k,d}(n)$ be the maximal size of a set ${A}\subseteq [n]$ such that the equation \[a_1a_2\dots a_k=x^d, \; a_1<a_2<\ldots<a_k\] has no solution with $a_1,a_2,\ldots,a_k\in {A}$ and integer $x$. Erd\H{o}s, S\'ark\"ozy and T. S\'os…

‹ 上一页 1 8 9 10 下一页 ›