中文
相关论文

相关论文: Two injective proofs of a conjecture of Simion

200 篇论文

Let $\lambda$, $\mu$, $\lambda'$, $\mu'$ be partitions. The conjecture of Lam, Postnikov and Pylyavskyy states that, if $\lambda+\mu = \lambda' + \mu'$, and $\min(\lambda_i-\lambda_j, \mu_i-\mu_j) \leq \lambda'_i - \lambda'_j \leq…

组合数学 · 数学 2026-05-01 David E Speyer

We provide a purely combinatorial proof of a skein exact sequence obeyed by double-point enhanced grid homology. We also extend the theory to coefficients over $\mathbb{Z},$ and discuss alternatives to the Ozsv\'ath-Szab\'o $\tau$…

几何拓扑 · 数学 2025-02-19 Ollie Thakar

In our joint paper with W. Fulton (math.AG/9804041) we prove a formula for the cohomology class of a quiver variety. This formula involves a new class of generalized Littlewood-Richardson coefficients, all of which surprisingly seem to be…

组合数学 · 数学 2007-05-23 Anders S. Buch

The $W_v$-Path Conjecture due to Klee and Wolfe states that any two vertices of a simple polytope can be joined by a path that does not revisit any facet. This is equivalent to the well-known Hirsch Conjecture. Klee proved that the…

组合数学 · 数学 2018-03-09 Michael D. Plummer , Dong Ye , Xiaoya Zha

Recently, Z. W. Sun put forward a series of conjectures on monotonicity of combinatorial sequences in the form of $\{z_n/z_{n-1}\}_{n=N}^\infty$ and $\{\sqrt[n+1]{z_{n+1}}/\sqrt[n]{z_n}\}_{n=N}^\infty$ for some positive integer $N$, where…

组合数学 · 数学 2015-12-04 Brian Y. Sun

Manna and Waldinger's theory of substitutions and unification has been verified using the Cambridge LCF theorem prover. A proof of the monotonicity of substitution is presented in detail, as an example of interaction with LCF. Translating…

计算机科学中的逻辑 · 计算机科学 2008-02-03 Lawrence C. Paulson

We show that only finitely many complex genus two curves and four punctured spheres admit rank two local systems of geometric origin, and moreover each carries finitely many. This gives further counterexamples to a conjecture of Esnault and…

数论 · 数学 2022-11-14 Yeuk Hay Joshua Lam

In a recent paper, the first author proved the log-concavity of the coefficients of the characteristic polynomial of a matroid realizable over a field of characteristic 0, answering a long-standing conjecture of Read in graph theory. We…

组合数学 · 数学 2012-02-16 June Huh , Eric Katz

This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…

组合数学 · 数学 2010-08-17 Li Liu , Yi Wang

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

组合数学 · 数学 2018-10-09 Jane Y. X. Yang

Following the approach to grid homology of links in $S^3$, we prove combinatorially that the grid homology of links in lens spaces defined by Baker, Grigsby, and Hedden is a link invariant. Further, using the sign assignment defined by…

几何拓扑 · 数学 2021-10-05 Samuel Tripp

We prove that if a unimodular random graph is almost surely planar and has finite expected degree, then it has a combinatorial embedding into the plane which is also unimodular. This implies the claim in the title immediately by a theorem…

概率论 · 数学 2025-02-14 Adam Timar

We prove the existence of a pair $(\Sigma ,\, \Gamma)$, where $\Sigma$ is a compact Riemann surface with $\text{genus}(\Sigma)\, \geq\, 2$, and $\Gamma\, \subset\, {\mathrm SL}(2, \mathbb C)$ is a cocompact lattice, such that there is a…

代数几何 · 数学 2021-12-07 Indranil Biswas , Sorin Dumitrescu , Lynn Heller , Sebastian Heller

Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…

组合数学 · 数学 2007-05-23 Jason Burns

We provide new Schmidt-type results through an investigation of two bijections, which are results involving partitions with parts counted only at given indices. Mork's bijection, the first of these, was originally given as a proof of…

组合数学 · 数学 2022-10-17 Hunter Waldron

We show that the h-vector of a ladder determinantal ring cogenerated by M=[u_1|v_1] is log-concave. Thus we prove an instance of a conjecture of Stanley, resp. Conca and Herzog

交换代数 · 数学 2007-05-23 Martin Rubey

An unresolved conjecture by Graham Higman states that for all $n\geq 1$ the number of conjugacy classes of the group of $n \times n$ unitriangular matrices with entries in the finite field $\mathbb{F}_q$ is a polynomial in $q$. In this…

表示论 · 数学 2022-08-17 Lucien Hennecart , Nikolai Perry

We give a short topological proof of coherence for categorified non-symmetric operads by using the fact that the diagrams involved form the 1-skeleton of simply connected CW complexes. We also obtain a "one-step" topological proof of Mac…

代数拓扑 · 数学 2024-11-01 Pierre-Louis Curien , Guillaume Laplante-Anfossi

Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and…

组合数学 · 数学 2007-05-23 Tomislav Došlić , Darko Veljan

The cycle double cover conjecture states that a graph is bridge-free if and only if there is a family of edge-simple cycles such that each edge is contained in exactly two of them. It was formulated independently by Szekeres (1973) and…

离散数学 · 计算机科学 2012-02-08 Alexander Souza