Generalized Dehn-Sommerville relations for hypergraphs

Generalized Dehn-Sommerville relations for hypergraphs

The generalized Dehn-Sommerville relations determine the odd subalgebra of the combinatorial Hopf algebra. We introduce a class of eulerian hypergraphs that satisfy the generalized Dehn-Sommerville relations for the combinatorial Hopf algebra of hypergraphs. We characterize a wide class of eulerian...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2014-12
Hauptverfasser: Grujic, Vladimir, Stojadinovic, Tanja, Jojic, Dusko
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorial analysis
Economic models
Graph theory
Graphs
Isomorphism
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Grujic, Vladimir
Stojadinovic, Tanja
Jojic, Dusko
description The generalized Dehn-Sommerville relations determine the odd subalgebra of the combinatorial Hopf algebra. We introduce a class of eulerian hypergraphs that satisfy the generalized Dehn-Sommerville relations for the combinatorial Hopf algebra of hypergraphs. We characterize a wide class of eulerian hypergraphs according to the combinatorics of underlying clutters. The analogous results hold for simplicial complexes by the isomorphism which is induced from the correspondence of clutters and simplicial complexes.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2075380339</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2075380339</sourcerecordid><originalsourceid>FETCH-proquest_journals_20753803393</originalsourceid><addsrcrecordid>eNqNyr0KwjAUQOEgCBbtOwScCzHXtHX2d9e9BHprUtIk3rSCPr0OPoDTGb4zY5kE2BT1VsoFy1PqhRCyrKRSkLHyjB5JO_vGlh_Q-OIahgHpaZ1DTuj0aINPvAvEzSsi3UlHk1Zs3mmXMP91ydan421_KSKFx4RpbPowkf9SI0WloBYAO_jv-gAQ-zX1</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2075380339</pqid></control><display><type>article</type><title>Generalized Dehn-Sommerville relations for hypergraphs</title><source>Free E- Journals</source><creator>Grujic, Vladimir ; Stojadinovic, Tanja ; Jojic, Dusko</creator><creatorcontrib>Grujic, Vladimir ; Stojadinovic, Tanja ; Jojic, Dusko</creatorcontrib><description>The generalized Dehn-Sommerville relations determine the odd subalgebra of the combinatorial Hopf algebra. We introduce a class of eulerian hypergraphs that satisfy the generalized Dehn-Sommerville relations for the combinatorial Hopf algebra of hypergraphs. We characterize a wide class of eulerian hypergraphs according to the combinatorics of underlying clutters. The analogous results hold for simplicial complexes by the isomorphism which is induced from the correspondence of clutters and simplicial complexes.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Combinatorial analysis ; Economic models ; Graph theory ; Graphs ; Isomorphism</subject><ispartof>arXiv.org, 2014-12</ispartof><rights>2014. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Grujic, Vladimir</creatorcontrib><creatorcontrib>Stojadinovic, Tanja</creatorcontrib><creatorcontrib>Jojic, Dusko</creatorcontrib><title>Generalized Dehn-Sommerville relations for hypergraphs</title><title>arXiv.org</title><description>The generalized Dehn-Sommerville relations determine the odd subalgebra of the combinatorial Hopf algebra. We introduce a class of eulerian hypergraphs that satisfy the generalized Dehn-Sommerville relations for the combinatorial Hopf algebra of hypergraphs. We characterize a wide class of eulerian hypergraphs according to the combinatorics of underlying clutters. The analogous results hold for simplicial complexes by the isomorphism which is induced from the correspondence of clutters and simplicial complexes.</description><subject>Combinatorial analysis</subject><subject>Economic models</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Isomorphism</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNyr0KwjAUQOEgCBbtOwScCzHXtHX2d9e9BHprUtIk3rSCPr0OPoDTGb4zY5kE2BT1VsoFy1PqhRCyrKRSkLHyjB5JO_vGlh_Q-OIahgHpaZ1DTuj0aINPvAvEzSsi3UlHk1Zs3mmXMP91ydan421_KSKFx4RpbPowkf9SI0WloBYAO_jv-gAQ-zX1</recordid><startdate>20141214</startdate><enddate>20141214</enddate><creator>Grujic, Vladimir</creator><creator>Stojadinovic, Tanja</creator><creator>Jojic, Dusko</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20141214</creationdate><title>Generalized Dehn-Sommerville relations for hypergraphs</title><author>Grujic, Vladimir ; Stojadinovic, Tanja ; Jojic, Dusko</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20753803393</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Combinatorial analysis</topic><topic>Economic models</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Isomorphism</topic><toplevel>online_resources</toplevel><creatorcontrib>Grujic, Vladimir</creatorcontrib><creatorcontrib>Stojadinovic, Tanja</creatorcontrib><creatorcontrib>Jojic, Dusko</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Grujic, Vladimir</au><au>Stojadinovic, Tanja</au><au>Jojic, Dusko</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Generalized Dehn-Sommerville relations for hypergraphs</atitle><jtitle>arXiv.org</jtitle><date>2014-12-14</date><risdate>2014</risdate><eissn>2331-8422</eissn><abstract>The generalized Dehn-Sommerville relations determine the odd subalgebra of the combinatorial Hopf algebra. We introduce a class of eulerian hypergraphs that satisfy the generalized Dehn-Sommerville relations for the combinatorial Hopf algebra of hypergraphs. We characterize a wide class of eulerian hypergraphs according to the combinatorics of underlying clutters. The analogous results hold for simplicial complexes by the isomorphism which is induced from the correspondence of clutters and simplicial complexes.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2014-12
issn 2331-8422
language eng
recordid cdi_proquest_journals_2075380339
source Free E- Journals
subjects Combinatorial analysis
Economic models
Graph theory
Graphs
Isomorphism
title Generalized Dehn-Sommerville relations for hypergraphs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T07%3A57%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Generalized%20Dehn-Sommerville%20relations%20for%20hypergraphs&rft.jtitle=arXiv.org&rft.au=Grujic,%20Vladimir&rft.date=2014-12-14&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2075380339%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2075380339&rft_id=info:pmid/&rfr_iscdi=true