中文
相关论文

相关论文: On the constant partial-dual polynomials of hyperm…

200 篇论文

Haxell's condition is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the…

数据结构与算法 · 计算机科学 2016-12-06 Chidambaram Annamalai

We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…

逻辑 · 数学 2013-08-19 Saugata Basu , Andrei Gabrielov , Nicolai Vorobjov

In the paper, we first classify all polynomial maps of the form $H=(u(x,y,z),v(x,y,z), h(x,y))$ in the case that $JH$ is nilpotent and $\deg_zv\leq 1$. After that, we generalize the structure of $H$ to…

代数几何 · 数学 2020-06-15 Dan Yan

Recently, Gross, Mansour, and Tucker introduced the partial Petrial polynomial, which enumerates all partial Petrials of a ribbon graph by Euler genus. They provided formulas or recursions for various families of ribbon graphs, including…

组合数学 · 数学 2025-01-09 Qi Yan , Yuancheng Li

In this paper, for a finite group, we discuss a method for calculating equivariant homology with constant coefficients. We apply it to completely calculate the geometric fixed points of the equivariant spectrum representing equivariant…

代数拓扑 · 数学 2020-11-24 Sophie Kriz

This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…

经典分析与常微分方程 · 数学 2026-05-28 K. Castillo

A hypermap is bipartite if its set of flags can be divided into two parts A and B so that both A and B are the union of vertices, and consecutive vertices around an edge or a face are contained in alternate parts. A bipartite hypermap is…

组合数学 · 数学 2016-11-22 Rui Duarte

Tutte's dichromate T(x,y) is a well known graph invariant. Using the original definition in terms of internal and external activities as our point of departure, we generalize the valuations T(x,1) and T(1,y) to hypergraphs. In the…

组合数学 · 数学 2011-03-08 Tamás Kálmán

In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.

组合数学 · 数学 2013-07-02 Shamik Ghosh , Raibatak Sen Gupta , M. K. Sen

The total matching polytope generalizes the stable set polytope and the matching polytope. In this paper, we first propose new facet-defining inequalities for the total matching polytope. We then give an exponential-sized, non-redundant…

离散数学 · 计算机科学 2023-12-29 Yuri Faenza , Luca Ferrarini

The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…

环与代数 · 数学 2021-05-05 Loïc Foissy

Consider a unimodular random planar map (URM) with an invariant ergodic percolation having infinite primal and dual clusters. We say that there is half-plane coexistence if both the percolation and its dual have infinite clusters when…

概率论 · 数学 2026-03-17 Ádám Timár

Our previous paper shows that the (vertex) spanning tree degree enumerator polynomial of a connected graph $G$ is a real stable polynomial (id est is non-zero if all variables have positive imaginary parts) if and only if $G$ is…

组合数学 · 数学 2023-10-30 Danila Cherkashin , Pavel Prozorov

By introducing the notion of distributive constant for a family of closed subschemes, we establish a general form of the second main theorem for algebraic nondegenerate meromorphic mappings from a generalized $p$-Parabolic manifold into a…

复变函数 · 数学 2026-02-17 Si Duc Quang

The local $h$-polynomial was introduced by Stanley as a fundamental enumerative invariant of a triangulation $\Delta$ of a simplex. This polynomial is known to have nonnegative and symmetric coefficients and is conjectured to be…

组合数学 · 数学 2025-07-01 Christos A. Athanasiadis

Let $\Gamma$ denote a finite (strongly) connected regular (di)graph with adjacency matrix $A$. The {\em Hoffman polynomial} $h(t)$ of $\Gamma=\Gamma(A)$ is the unique polynomial of smallest degree satisfying $h(A)=J$, where $J$ denotes the…

组合数学 · 数学 2024-03-04 Giusy Monzillo , Safet Penjić

Hyperbolic polynomials are real multivariate polynomials with only real roots along a fixed pencil of lines. Testing whether a given polynomial is hyperbolic is a difficult task in general. We examine different ways of translating…

代数几何 · 数学 2018-10-24 Papri Dey , Daniel Plaumann

Orthogonal polynomials with respect to the hypergeometric distribution on lattices in polyhedral domains in ${\mathbb R}^d$, which include hexagons in ${\mathbb R}^2$ and truncated tetrahedrons in ${\mathbb R}^3$, are defined and studied.…

经典分析与常微分方程 · 数学 2020-02-13 Plamen Iliev , Yuan Xu

In this note we settle two open problems in the theory of permanents by using recent results from other areas of mathematics. Bapat conjectured that certain quotients of permanents, which generalize symmetric function means, are concave. We…

环与代数 · 数学 2012-04-18 Petter Brändén

The present paper investigates properties of quasi-stable ideals and of Borel-fixed ideals in a polynomial ring $k[x_0,\dots,x_n]$, in order to design two algorithms: the first one takes as input $n$ and an admissible Hilbert polynomial…

交换代数 · 数学 2015-03-20 Cristina Bertone