中文
相关论文

相关论文: The displacement and split decompositions for a $Q…

200 篇论文

We developpe a direct sum decomposition for n-dual spaces.

泛函分析 · 数学 2007-05-23 Javier H. Guachalla

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…

组合数学 · 数学 2017-02-14 Seongmin Ok , Peter Tittmann

In his famous theorem (1982), Douglas Leonard characterized the $q$-Racah polynomials and their relatives in the Askey scheme from the duality property of $Q$-polynomial distance-regular graphs. In this paper we consider a nonsymmetric (or…

组合数学 · 数学 2018-09-25 Jae-Ho Lee

We introduce two graph polynomials and discuss their properties. One is a polynomial of two variables whose investigation is motivated by the performance analysis of the Bethe approximation of the Ising partition function. The other is a…

组合数学 · 数学 2010-06-07 Yusuke Watanabe , Kenji Fukumizu

We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…

符号计算 · 计算机科学 2011-04-06 Changbo Chen , Marc Moreno Maza

We present a simple method to decompose the Green forms corresponding to a large class of interesting symmetric Dirichlet forms into integrals over symmetric positive semi-definite and finite range (properly supported) forms that are…

概率论 · 数学 2019-05-10 Roland Bauerschmidt

The distance matrix $\mathcal{D}(G)$ of a graph $G$ is the matrix containing the pairwise distances between vertices, and the distance Laplacian matrix is $\mathcal{D}^L(G)=T(G)-\mathcal{D}(G)$, where $T(G)$ is the diagonal matrix of row…

Let $\bold G$ be a reductive algebraic group defined over $\Q$, and let $\Gamma$ be an arithmetic subgroup of $\bold G(\Q)$. Let $X$ be the symmetric space for $\bold G(\R)$, and assume $X$ is contractible. Then the cohomology (mod torsion)…

表示论 · 数学 2016-09-06 Avner Ash , Mark W. McConnell

Gromov introduced the notion of a pyramid as a generalization of a metric measure space, based on the idea of the concentration of measure phenomenon. In this paper, we introduce the concept of a direct sum of pyramids, which naturally…

度量几何 · 数学 2026-04-15 Toshiaki Miyamoto

In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let $\Gamma$ and $\Gamma'$ be finite simple graphs with at least three vertices such that there exists a bijective map $f:V(\Gamma) \rightarrow V(\Gamma')$ and…

组合数学 · 数学 2021-06-22 Tetsuya Hosaka

We show that the large Cartesian powers of any graph have log-concave valencies with respect to a ffxed vertex. We show that the series of valencies of distance regular graphs is log-concave, thus improving on a result of (Taylor,…

组合数学 · 数学 2025-01-22 Minjia Shi , Lu Wang , Patrick Sole

In this paper we systematically study various properties of the distance graph in ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field ${\Bbb F}_q$ with $q$ elements. In the process we compute the diameter of distance…

组合数学 · 数学 2008-04-21 Derrick Hart , Alex Iosevich , Doowon Koh , Steve Senger , Ignacio Uriarte-Tuero

A {\em $(d,h)$-decomposition} of a graph $G$ is an order pair $(D,H)$ such that $H$ is a subgraph of $G$ where $H$ has the maximum degree at most $h$ and $D$ is an acyclic orientation of $G-E(H)$ of maximum out-degree at most $d$. A graph…

组合数学 · 数学 2022-04-19 Lin Niu , Xiangwen Li

The commuting graph of a group G, denoted by Gamma(G), is the simple undirected graph whose vertices are the non-central elements of G and two distinct vertices are adjacent if and only if they commute. Let Z_m be the commutative ring of…

群论 · 数学 2010-04-12 Michael Giudici , Aedan Pope

In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most $k$, when an effective…

离散数学 · 计算机科学 2020-05-13 Hans L. Bodlaender , Josse van Dobben de Bruyn , Dion Gijswijt , Harry Smit

In this paper, we show that the edge connectivity of a distance-regular digraph $\Gamma$ with valency $k$ is $k$ and for $k>2$, any minimum edge cut of $\Gamma$ is the set of all edges going into (or coming out of) a single vertex. Moreover…

组合数学 · 数学 2017-02-07 S. Ashkboos , G. R. Omidi , F. Shafiei , K. Tajbakhsh

We extend the theory of equitable decompositions, in which, if a graph has a particular type of symmetry, i.e. a uniform or basic automorphism $\phi$, it is possible to use $\phi$ to decompose a matrix $M$ appropriately associated with the…

组合数学 · 数学 2017-08-01 Amanda Francis , Dallas Smith , Derek Sorenson , Ben Webb

We prove two criteria for direct sum decomposability of homogeneous polynomials. For a homogeneous polynomial with a non-zero discriminant, we interpret direct sum decomposability of the polynomial in terms of factorization properties of…

代数几何 · 数学 2019-09-18 Maksym Fedorchuk

We study a specific class of deformations of curve singularities: the case when the singular point splits to several ones, such that the total $\delta$ invariant is preserved. These are also known as equi-normalizable or equi-generic…

代数几何 · 数学 2010-01-18 Dmitry Kerner

Let $\Gamma=(V,E)$ be a finite simple graph. A matching $M \subseteq E$ is positive if there exists a weight function on $V$ such that the matching $M$ is characterized by those edges with positive weights. A positive matching decomposition…

‹ 上一页 1 8 9 10 下一页 ›