in this note by considering a complete lattice l, we define thenotion of an l-fuzzy hyperrelation on a given non-empty set x. then wedefine the concepts of (pom)l-fuzzy graph, hypergraph and subhypergroupand obtain some related results. in particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (pom)l-fuzzy subhypergroups ...

Random walks in graphs have been applied to various network exploration and network maintenance problems. In some applications, however, it may be more natural, and more accurate, to model the underlying network not as a graph but as a hypergraph, and solutions based on random walks require a notion of random walks in hypergraphs. At each step, a random walk on a hypergraph moves from its curre...

2 Structure of Norming hypergraph pairs 6 2.1 Two Hölder type inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2 Factorizable hypergraph pairs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.3 Semi-norming hypergraph pairs that are not norming . . . . . . . . . . . . . . . . . . . . 12 2.4 Some facts about Gowers norms . . . . . . . . . ....

r is called commuting regular ring (resp. semigroup) if for each x,y $in$ r thereexists a $in$ r such that xy = yxayx. in this paper, we introduce the concept of commuting$pi$-regular rings (resp. semigroups) and study various properties of them.

We study leading-edge local search heuristics for balanced hypergraph partitioning and Boolean satisfiability, intending the generalization of such heuristics beyond their original domains. We adapt the Fiduccia Mattheyses (FM) hypergraph partitioning heuristic to Boolean Satisfiability (SAT), and the WalkSAT SAT solver to hypergraph partitioning. Focusing on balanced hypergraph partitioning, w...

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set [N ] = {1, 2, . . . , N} was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph is the hypergraph of sums of k (k ≥ 1 fixed) arithmetic progressions. The hyperedges of this hypergraph are of the form A1 + A2 + . . . + Ak in [N ], wher...

Using the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph, we continue the investigation of the existence of a decomposition of the complete 3-uniform hypergraph into Hamiltonian cycles began by Bailey and Stevens. We also discuss two extensions of the problem: to the complete 3-uniform hypergraph from which a parallel class of triples has been removed, and to the com...

The paper considers the problem of computing a maximal independent set in a hypergraph (see 3] and 7]). We present an eecient deterministic NC algorithm for nding a maximal independent set in a hypergraph of dimension 3: the algorithm runs in time O(log 4 n) time on n + m processors of an EREW PRAM and is optimal up to a polylogarithmic factor. Our algorithm adapts the technique of Goldberg and...

We introduce two new notions for hypergraphs, hypertree-depth and minors in hypergraphs. We characterise hypergraphs of bounded hypertree-depth by the ultramonotone robber and marshals game, by vertex-hyperrankings and by centred hypercolourings. Furthermore, we show that minors in hypergraphs are ‘well-behaved’ with respect to hypertree-depth and other hypergraph invariants, such as generalise...