Finite reflection groups and graph norms
Given a graph H on vertex set {1,2,⋯,n} and a function f:[0,1]2→R, define ∥f∥H:=∣∣∣∣∫∏ij∈E(H)f(xi,xj)dμ|V(H)|∣∣∣∣1/|E(H)|, where μ is the Lebesgue measure on [0,1]. We say that H is norming if ∥⋅∥H is a semi-norm. A similar notion ∥⋅∥r(H) is defined by ∥f∥r(H):=∥|f|∥H and H is said to be we...
Main Authors: | Conlon, D, Lee, J |
---|---|
Format: | Journal article |
Published: |
Elsevier
2017
|
Similar Items
-
Invertible Graphs of Finite Groups
by: T. Chalapathi, et al.
Published: (2018-08-01) -
Subgroup Graphs of Finite Groups
by: Ojonugwa Ejima, et al.
Published: (2021-12-01) -
Neutrosophic Graphs of Finite Groups
by: T. Chalapathi, et al.
Published: (2017-02-01) -
Directed graph in finite automata over finite groups
by: Fong, Wan Heng, et al.
Published: (2015) -
Sidorenko's conjecture, graph norms, and pseudorandomness
by: Lee, J
Published: (2017)