中文
相关论文

相关论文: Counterexamples to the interpolating conjecture on…

200 篇论文

Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…

组合数学 · 数学 2011-08-22 Alexander Engström , Patrik Norén

We prove a recent conjecture by Ulas on reducible polynomial substitutions.

数论 · 数学 2019-08-01 Peter Müller

For a ribbon graph $G$ we consider an alternating link $L_G$ in the 3-manifold $G\times I$ represented as the product of the oriented surface $G$ and the unit interval $I$. We show that the Kauffman bracket $[L_G]$ is an evaluation of the…

几何拓扑 · 数学 2016-09-07 Sergei Chmutov , Igor Pak

A graph H is common if the number of monochromatic copies of H in a 2-edge-colouring of the complete graph is minimised by the random colouring. Burr and Rosta, extending a famous conjecture by Erdos, conjectured that every graph is common.…

组合数学 · 数学 2022-04-28 Andrzej Grzesik , Joonkyung Lee , Bernard Lidický , Jan Volec

By finding orthogonal representation for a family of simple connected called $\delta$-graphs it is possible to show that $\delta$-graphs satisfy delta conjecture. An extension of the argument to graphs of the form…

组合数学 · 数学 2018-06-20 Pedro Díaz Navarro

We study the Fibered Isomorphism Conjecture of Farrell and Jones in L-theory for groups acting on trees. In several cases we prove the conjecture. This includes wreath products of abelian groups and free metabelian groups. We also deduce…

K理论与同调 · 数学 2012-04-30 S. K. Roushon

We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for graphs which has a cut edge or a…

交换代数 · 数学 2013-11-19 Dariush Kiani , Sara Saeedi Madani

We construct new rational approximants of Euler's constant that improve those of Aptekarev et al. (2007) and Rivoal (2009). The approximants are given in terms of certain (mixed type) multiple orthogonal polynomials associated with the…

数论 · 数学 2025-05-28 Thomas Wolfs , Walter Van Assche

We introduce the notion of bipartiteness ratio for graphons. We prove the dual Cheeger-Buser inequality for graphons, which relates the gap between $2$ and the top of the spectrum of the Laplacian of a graphon with its bipartiteness ratio.…

组合数学 · 数学 2025-02-24 Mugdha Mahesh Pokharanakar

We associate root polytopes to directed graphs and study them by using ribbon structures. Most attention is paid to what we call the semi-balanced case, i.e., when each cycle has the same number of edges pointing in the two directions.…

组合数学 · 数学 2024-08-16 Tamás Kálmán , Lilla Tóthmérész

In this paper we study the higher-order Euler numbers and polynomials and we introduce the mutiple zeta functions which interpolate higher-order Euler polynomials and numbers at negative integers

数论 · 数学 2010-01-12 Taekyun Kim

Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…

组合数学 · 数学 2020-06-09 Suryaprakash Nagoji Rao

We consider the analogue of Kutasov-Schwimmer-Seiberg duality for two-dimensional $\mathcal{N}=(2,2)$ $U(k)$ gauge theory with one adjoint $X$ with the superpotential $\Tr X^{l+1}$ and with fundamental and anti-fundamantal chiral…

高能物理 - 理论 · 物理学 2017-10-25 Kyoungho Cho , Hyungchul Kim , Jaemo Park

In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoint triangles. This conjecture have been proved for several…

组合数学 · 数学 2023-07-20 Luis Chahua , Juan Gutiérrez

We prove several different anti-concentration inequalities for functions of independent Bernoulli-distributed random variables. First, motivated by a conjecture of Alon, Hefetz, Krivelevich and Tyomkyn, we prove some "Poisson-type"…

组合数学 · 数学 2023-06-22 Jacob Fox , Matthew Kwan , Lisa Sauermann

In this paper, we study relations among several types of Eulerian polynomials from a combinatorial viewpoint. We establish an identity between the restricted Eulerian polynomials of types $A$ and $B$. As an application, we present a…

组合数学 · 数学 2026-03-04 Zhong-Xue Zhang

In this series of papers, we propose a theory of enumerative invariants counting self-dual objects in self-dual categories. Ordinary enumerative invariants in abelian categories can be seen as invariants for the structure group $\mathrm{GL}…

代数几何 · 数学 2025-04-01 Chenjing Bu

Batson's conjecture is a non-orientable version of Milnor's conjecture, which states that the 4-ball genus of a torus knot $T(p,q)$ is equal to $\frac{(p-1)(q-1)}{2}$. Batson's conjecture states that the nonorientable 4-ball genus is equal…

几何拓扑 · 数学 2020-11-03 Vincent Longo

We classify all knot diagrams of genus two and three, and give applications to positive, alternating and homogeneous knots, including a classification of achiral genus 2 alternating knots, slice or achiral 2-almost positive knots, a proof…

几何拓扑 · 数学 2008-08-30 A. Stoimenow

We give a combinatorial proof of an identity that involves Eulerian numbers and was obtained algebraically by Brenti and Welker (2009). To do so, we study alcoved triangulations of dilated hypersimplices. As a byproduct, we describe the…

组合数学 · 数学 2025-03-31 Jerónimo Valencia-Porras