English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A k -hypertournament is a complete k -hypergraph with each k -edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a k hypertournament, the score si (losing score ri ) of a vertex vi is the number of edges containing vi in which vi is not the last element (in which vi is the last element). In this paper we obtain inequalities involving powers of scores and losing scores by using classical results from mathematical analysis (such as Holder’s inequality) and show that equality holds if and only if the hypertournament is regular. We then use these inequalities to give a short proof of a result on the existence of regular hypertournaments. We also obtain an upper bound on the number of directed paths of length 2 in tournaments and hypertournaments, prove that the bound is sharp and that it is realized by regular hypertournaments. Mathematics subject classification (2010): 05C20, 05C65.

Scores, inequalities and regular hypertournaments