English
Related papers

Related papers: Bruhat and balanced graphs

200 papers

For several important classes of manifolds acted on by the torus, the information about the action can be encoded combinatorially by a regular n-valent graph with vector labels on its edges, which we refer to as the torus graph. By analogy…

Algebraic Topology · Mathematics 2011-11-09 Hiroshi Maeda , Mikiya Masuda , Taras Panov

We study a family of polynomials whose values express degrees of Schubert varieties in the generalized complex flag manifold G/B. The polynomials are given by weighted sums over saturated chains in the Bruhat order. We derive several…

Combinatorics · Mathematics 2007-05-23 Alexander Postnikov , Richard P. Stanley

Fair graph partition of social networks is a crucial step toward ensuring fair and non-discriminatory treatments in unsupervised user analysis. Current fair partition methods typically consider node balance, a notion pursuing a…

Social and Information Networks · Computer Science 2023-07-18 Tingwei Liu , Peizhao Li , Hongfu Liu

We prove two sharp sufficient conditions for hamiltonian cycles in balanced bipartite directed graph. Let $D$ be a strongly connected balanced bipartite directed graph of order $2a$. Let $x,y$ be distinct vertices in $D$. $\{x,y\}$…

Combinatorics · Mathematics 2016-05-02 Samvel Kh. Darbinyan

Given a graph $H$, a balanced subdivision of $H$ is obtained by replacing all edges of $H$ with internally disjoint paths of the same length. In this paper, we prove that for any graph $H$, a linear-in-$e(H)$ bound on average degree…

Combinatorics · Mathematics 2025-01-17 Jaehoon Kim , Hong Liu , Yantao Tang , Guanghui Wang , Donglei Yang , Fan Yang

Spectral clustering is popular among practitioners and theoreticians alike. While performance guarantees for spectral clustering are well understood, recent studies have focused on enforcing ``fairness'' in clusters, requiring them to be…

Machine Learning · Computer Science 2022-09-27 Shubham Gupta , Ambedkar Dukkipati

We study the complexity of finding an optimal hierarchical clustering of an unweighted similarity graph under the recently introduced Dasgupta objective function. We introduce a proof technique, called the normalization procedure, that…

Computational Complexity · Computer Science 2020-08-10 Svein Høgemo , Christophe Paul , Jan Arne Telle

We introduce a family of multi-way Cheeger-type constants $\{h_k^{\sigma}, k=1,2,\ldots, n\}$ on a signed graph $\Gamma=(G,\sigma)$ such that $h_k^{\sigma}=0$ if and only if $\Gamma$ has $k$ balanced connected components. These constants…

Combinatorics · Mathematics 2019-12-09 Fatihcan M. Atay , Shiping Liu

We study generating functions of strict and non-strict order polynomials of series-parallel posets, called order series. These order series are closely related to Ehrhart series and h*-polynomials of the associated order polytopes. We…

Combinatorics · Mathematics 2026-01-27 Jose Antonio Arciniega-Nevarez , Marko Berghoff , Eric Dolores-Cuenca

We define graded Hopf algebras with bases labeled by various types of graphs and hypergraphs, provided with natural embeddings into an algebra of polynomials in infinitely many variables. These algebras are graded by the number of edges and…

Combinatorics · Mathematics 2008-12-19 Jean-Christophe Novelli , Jean-Yves Thibon , Nicolas M. Thiéry

We introduce two notions of hyperbolicity for not necessarily K\"ahler $n$-dimensional compact complex manifolds $X$. The first, called {\it balanced hyperbolicity}, generalises Gromov's K\"ahler hyperbolicity by means of Gauduchon's…

Complex Variables · Mathematics 2022-02-15 Samir Marouani , Dan Popovici

We introduce a new class of symmetric algebras, which we call hybrid algebras. This class contains on one extreme Brauer graph algebras, and on the other extreme general weighted surface algebras. We show that hybrid algebras are precisely…

Representation Theory · Mathematics 2024-01-09 Karin Erdmann , Andrzej Skowroński

A simplicial complex of dimension $d-1$ is said to be balanced if its graph is $d$-colorable. Juhnke-Kubitzke and Murai proved an analogue of the generalized lower bound theorem for balanced simplicial polytopes. We establish a…

Combinatorics · Mathematics 2016-08-30 Martina Juhnke-Kubitzke , Satoshi Murai , Isabella Novik , Connor Sawaske

We explore the codimension one strata in the degree-one cohomology jumping loci of a finitely generated group, through the prism of the multivariable Alexander polynomial. As an application, we give new criteria that must be satisfied by…

Algebraic Geometry · Mathematics 2008-01-28 Alexandru Dimca , Stefan Papadima , Alexander I. Suciu

From a combinatorial perspective, we establish three inequalities on coefficients of $R$- and Kazhdan-Lusztig polynomials for crystallographic Coxeter groups: (1) Nonnegativity of $(q-1)$-coefficients of $R$-polynomials, (2) a new criterion…

Combinatorics · Mathematics 2012-11-20 Masato Kobayashi

We study questions surrounding cup-product maps which arise from pairs of non-degenerate line bundles on an abelian variety. Important to our work is Mumford's index theorem which we use to prove that non-degenerate line bundles exhibit…

Algebraic Geometry · Mathematics 2018-09-05 Nathan Grieve

In 2009, Kong, Wang, and Lee introduced the problem of finding the edge-balanced index sets ($EBI$) of complete bipartite graphs $K_{m,n}$, where they examined the cases $n=1$, $2$, $3$, $4$, $5$ and the case $m=n$. Since then the problem…

Combinatorics · Mathematics 2015-09-08 Ha Dao , Hung Hua , Michael Ngo , Christopher Raridan

Any two reduced expressions for the same Coxeter group element are related by a sequence of commutation and braid moves. Two reduced expressions are said to be braid equivalent if they are related via a sequence of braid moves. Braid…

Combinatorics · Mathematics 2024-09-02 Jillian Barnes , Jadyn V. Breland , Dana C. Ernst , Ruth Perry

In this paper, we discuss the Hamiltonicity of graphs in terms of Wiener index, hyper-Wiener index and Harary index of their quasi-complement or complement. Firstly, we give some sufficient conditions for an balanced bipartite graph with…

Combinatorics · Mathematics 2018-04-10 Guidong Yu , Lifang Ren , Gaixiang Cai

In this paper, we prove tight sufficient conditions for traceability and Hamiltonicity of connected graphs with given minimum degree, in terms of Wiener index and Harary index. We also prove some result on Hamiltonicity of balanced…

Combinatorics · Mathematics 2017-01-30 Hongbo Hua , Bo Ning
‹ Prev 1 4 5 6 7 8 10 Next ›