中文
相关论文

相关论文: A New Proof of Fine's Identity using Wildberger's …

200 篇论文

Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we…

代数几何 · 数学 2017-07-04 Olivier Benoist

In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients $\binom{n}{m}$, for $m$ in the range $0 \leq m \leq n$, that are not divisible by $p$. We give a matrix product that generalizes Fine's formula,…

数论 · 数学 2023-09-04 Eric Rowland

In 1947 Fine obtained an expression for the number of binomial coefficients on row n of Pascal's triangle that are nonzero modulo p. In this paper we use Kummer's theorem to generalize Fine's theorem to prime powers, expressing the number…

数论 · 数学 2011-12-14 Eric Rowland

Hilbert proved in 1888 that a positive semi-definite (PSD) homogeneous quartic polynomial of three variables always can be expressed as the sum of squares (SOS) of three quadratic polynomials, and a psd homogeneous quartic polynomial of…

最优化与控制 · 数学 2025-07-18 Chunfeng Cui , Liqun Qi , Yi Xu

Let $\sum_{d|n}$ denote sum over divisors of a positive integer $n$, and $t_{r}(n)$ denote the number of representations of $n$ as a sum of $r$ triangular numbers. Then we prove that $$…

综合数学 · 数学 2020-12-22 Sumit Kumar Jha

In 2025, Wildberger and Rubine showed the formal series zero of the univariate geometric polynomial is $\mathbf{S}$, the generating series for the hyper-Catalan numbers $\mathbf{C}_m$, which count the number of roofed subdivided polygons…

组合数学 · 数学 2025-08-12 Dean Rubine , Pratham Mukewar

Hilbert famously showed that polynomials in n variables are not too complicated, in various senses. For example, the Hilbert Syzygy Theorem shows that the process of resolving a module by free modules terminates in finitely many (in fact,…

交换代数 · 数学 2019-05-14 Daniel Erman , Steven V Sam , Andrew Snowden

The hyper-Catalan number $C[m_2,m_3,m_4,\ldots]$ counts the number of subdivisions of a roofed polygon into $m_2$ triangles, $m_3$ quadrilaterals, $m_4$ pentagons, etc. Its closed form has been known since Erd\'elyi and Etherington, 1940.…

组合数学 · 数学 2025-07-08 Dean Rubine

By using the Rodriguez-Villegas-Mortenson supercongruences, we prove four supercongruences on sums involving binomial coefficients, which were originally conjectured by Sun. We also confirm a related conjecture of Guo on integer-valued…

数论 · 数学 2017-08-31 Ji-Cai Liu

One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…

数论 · 数学 2014-01-14 Daniel C. McDonald

The long-standing topological Tverberg conjecture claimed, for any continuous map from the boundary of an $N(q,d):=(q-1)(d+1)$-simplex to $d$-dimensional Euclidian space, the existence of $q$ pairwise disjoint subfaces whose images have…

组合数学 · 数学 2018-08-23 Steven Simon

Let R denote the reals, and let h: R^n --> R be a continuous, piecewise-polynomial function. The Pierce-Birkhoff conjecture (1956) is that any such h is representable in the form sup_i inf_j f_{ij}, for some finite collection of polynomials…

代数几何 · 数学 2010-02-02 Charles N. Delzell

In 1888 Hilbert showed that every nonnegative homogeneous polynomial with real coefficients of degree $2d$ in $n$ variables is a sum of squares if and only if $d=1$ (quadratic forms), $n=2$ (binary forms) or $(n,d)=(3,2)$ (ternary…

代数几何 · 数学 2014-05-07 Simone Naldi

We present a different proof of the following identity due to Munarini, which generalizes a curious binomial identity of Simons. \begin{align*} \sum_{k=0}^{n}\binom{\alpha}{n-k}\binom{\beta+k}{k}x^k…

组合数学 · 数学 2023-01-24 Necdet Batir , Sezer Sorgunand Sevda Atpinar

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

组合数学 · 数学 2026-04-29 Alexander Povolotsky

A theorem of Tverberg from 1966 asserts that every set $X\subset\mathbb{R}^d$ of $n=T(d,r)=(d+1)(r-1)+1$ points can be partitioned into $r$ pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition…

组合数学 · 数学 2017-05-17 Moshe White

The coefficients c(n,k) defined by (1-k^2x)^(-1/k) = sum c(n,k) x^n reduce to the central binomial coefficients for k=2. Motivated by a question of H. Montgomery and H. Shapiro for the case k=3, we prove that c(n,k) are integers and study…

数论 · 数学 2015-05-13 Armin Straub , Tewodros Amdeberhan , Victor H. Moll

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

组合数学 · 数学 2018-12-05 Yuriy Choliy , Andrew V. Sills

Robin Hartshorne and Alexander Hirschowitz proved that a generic collection of lines on $\mathbb P^n$, $n \geq 3$, has bipolynomial Hilbert Function. We extended this result to a specialization of the collection of generic lines, by…

代数几何 · 数学 2010-06-15 Enrico Carlini , Maria Virginia Catalisano , Anthony V. Geramita

In 1888, Hilbert described how to find real polynomials in more than one variable which take only non-negative values but are not a sum of squares of polynomials. His construction was so restrictive that no explicit examples appeared until…

代数几何 · 数学 2007-07-17 Bruce Reznick
‹ 上一页 1 2 3 10 下一页 ›