中文
相关论文

相关论文: An inequality on broken chessboards

200 篇论文

Elementary proofs are given for sums of Schur functions over partitions into at most n parts each less than or equal to m for which i) all parts are even, ii) all parts of the conjugate partition are even. Also, an elementary proof of a…

组合数学 · 数学 2007-05-23 David M. Bressoud

The problem of representing a given positive integer as a sum of four squares of integers has been widely concerned for a long time, and for a given positive odd $n$ one can find a representation by doing arithmetic in a maximal order of…

数论 · 数学 2022-05-03 Zhaonan Wang , Yingpu Deng

We are discussing certain combinatorial and counting problems related to quadratic algebras. First we give examples which confirm the Anick conjecture on the minimal Hilbert series for algebras given by n generators and n(n-1)/2 relations…

环与代数 · 数学 2008-01-22 Peter Cameron , Natalia Iyudu

Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…

组合数学 · 数学 2021-09-08 Aida Abiad , Christopher Hojny , Sjanne Zeijlemaker

In this paper we show that a split central simple algebra with quadratic pair which decomposes into a tensor product of quaternion algebras with involution and a quaternion algebra with quadratic pair is adjoint to a quadratic Pfister form.…

环与代数 · 数学 2016-04-15 Karim Johannes Becher , Andrew Dolphin

The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…

数据结构与算法 · 计算机科学 2020-07-29 Ajinkya Gaikwad , Soumen Maity , Shuvam Kant Tripathi

Hilbert's ternary quartic theorem states that every nonnegative degree 4 homogeneous polynomial in three variables can be written as a sum of three squares of homogeneous quadratic polynomials. We give a linear-algebraic approach to…

代数几何 · 数学 2019-05-14 Anatolii Grinshpan , Hugo J. Woerdeman

We prove the 4-uniform Erd\H{o}s Matching Conjecture for every matching number $s\ge 6961$. The proof has two parts. First, building on ideas from Frankl--R\"odl--Ruci\'nski, we formulate a general finite-board criterion for the $r$-uniform…

组合数学 · 数学 2026-05-26 Jianfeng Hou , Caiyun Hu , Xizhi Liu

MacMahon enumerated the plane partitions in an $a \times b \times c$ box. These are in bijection to lozenge tilings of a hexagon, to certain perfect matchings, and to families of non-intersecting lattice paths. In this work we consider more…

组合数学 · 数学 2013-05-08 David Cook , Uwe Nagel

We give a characterization of finite sets of triples of elements (e.g., positive integers) that can be colored with two colors such that for every element $i$ in each color class there exists a triple which does not contain $i$. We give a…

组合数学 · 数学 2020-08-24 Balázs Keszegh

We study two measures of uncolourability of cubic graphs, their colouring defect and perfect matching index. The colouring defect of a cubic graph $G$ is the smallest number of edges left uncovered by three perfect matchings; the perfect…

组合数学 · 数学 2025-05-26 Ján Karabáš , Edita Máčajová , Roman Nedela , Martin Škoviera

A coloring is called $s$-wide if no walk of length $2s-1$ connects vertices of the same color. A graph is $s$-widely colorable with $t$ colors if and only if it admits a homomorphism into a universal graph $W(s,t)$. Tardif observed that the…

组合数学 · 数学 2021-02-08 Anna Gujgiczer , Gábor Simonyi

We briefly review the results of our paper hep-th/0009013: we study certain perturbative solutions of left-unilateral matrix equations. These are algebraic equations where the coefficients and the unknown are square matrices of the same…

高能物理 - 理论 · 物理学 2014-11-18 B. L. Cerchiai , B. Zumino

We address a core partition regularity problem in Ramsey theory by proving that every finite coloring of the positive integers contains monochromatic Pythagorean pairs, i.e., $x,y\in \mathbb{N}$ such that $x^2\pm y^2=z^2$ for some $z\in…

组合数学 · 数学 2025-02-19 Nikos Frantzikinakis , Oleksiy Klurman , Joel Moreira

Motivated by different characterizations of planar graphs and the 4-Color Theorem, several structural results concerning graphs of high chromatic number have been obtained. Toward strengthening some of these results, we consider the…

Let $W$ be a finite Coxeter group. It is well-known that the number of involutions in $W$ is equal to the sum of the degrees of the irreducible characters of $W$. Following a suggestion of Lusztig, we show that this equality is compatible…

表示论 · 数学 2011-12-20 Meinolf Geck

Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…

组合数学 · 数学 2014-03-07 Nikos Frantzikinakis , Bernard Host

Let $(W,S)$ be a finite Coxeter system with root system $R$ and with set of positive roots $R^+$. For $\alpha\in R$, $v,w\in W$, we denote by $\partial_\alpha$, $\partial_w$ and $\partial_{w/v}$ the divided difference operators and skew…

量子代数 · 数学 2018-04-18 Christoph Bärligea

Motivated by a new way of visualizing hypergraphs, we study the following problem. Consider a rectangular grid and a set of colors $\chi$. Each cell $s$ in the grid is assigned a subset of colors $\chi_s \subseteq \chi$ and should be…

计算几何 · 计算机科学 2017-09-04 Arthur van Goethem , Irina Kostitsyna , Marc van Kreveld , Wouter Meulemans , Max Sondag , Jules Wulms

We construct geometrically the generating fields of a W algebra which acts irreducibly on the direct sum of the cohomology rings of the Hilbert schemes of n points on a projective surface for all n. We compute explicitly the commutators…

代数几何 · 数学 2007-05-23 Wei-Ping Li , Zhenbo Qin , Weiqiang Wang