Results 11 to 20 of about 78 (75)
Characterizing divergence and thickness in right‐angled Coxeter groups
Abstract We completely classify the possible divergence functions for right‐angled Coxeter groups (RACGs). In particular, we show that the divergence of any such group is either polynomial, exponential, or infinite. We prove that a RACG is strongly thick of order k$k$ if and only if its divergence function is a polynomial of degree k+1$k+1$.
Ivan Levcovitz
wiley +1 more source
Characterization of the degree sequences of (quasi) regular uniform hypergraphs
International audienceIn hypergraph theory, determining a characterization of the degree sequence $d=(d_1,d_2,\ldots,d_n)$ where $d_1\ge d_2\ge\ldots,d_n$ are positive integers, of an $h$-uniform simple hypergraph $\cal H$, and deciding the complexity ...
Frosini A. +5 more
core +1 more source
Abstract Problem solving is often regarded as one of the most essential cognitive functions in our daily lives, and, for that reason, educational theorists have long stressed the need for its development. As cognitive flexibility is a fundamental characteristic necessary throughout the problem‐solving process, the purpose of this study is to analyse ...
Javier del Olmo‐Muñoz +4 more
wiley +1 more source
Resource allocation for multi‐IRS‐aided D2D communication underlying cellular networks
Abstract This paper investigates the resource allocation design in device‐to‐device (D2D) communication underlying cellular networks, which is assisted by multiple intelligent reflecting surfaces (IRSs) deployed at the cell boundary to enhance desired signals and mitigate interference between D2D pairs and CUs.
Maliheh Forouzanmehr +2 more
wiley +1 more source
Spectrum of Superhypergraphs via Flows
For any n ∈ ℕ and given nonempty subset V, the concept of n‐superhypergraphs is introduced by Florentin Smarandache based on Pn(V) (n‐th power set of V). In this paper, we present the novel concepts supervertices, superedges, and superhypergraph via the concept of flow.
Mohammad Hamidi +3 more
wiley +1 more source
Coloring the Voronoi tessellation of lattices
Abstract In this paper we define the chromatic number of a lattice: It is the least number of colors one needs to color the interiors of the cells of the Voronoi tessellation of a lattice so that no two cells sharing a facet are of the same color. We compute the chromatic number of the root lattices, their duals, and of the Leech lattice, we consider ...
Mathieu Dutour Sikirić +3 more
wiley +1 more source
The unmanned aerial vehicle‐ (UAV‐) assisted sub‐6 GHz disaster relief networks cannot meet high‐speed transmission requirements. In this paper, the millimeter wave (mmWave) frequency band is combined with the sub‐6 GHz frequency band to build a high‐speed UAV‐assisted disaster relief network.
Jinsong Gui +2 more
wiley +1 more source
Cloud computing plays an essential role as a source for outsourcing data to perform mining operations or other data processing, especially for data owners who do not have sufficient resources or experience to execute data mining techniques. However, the privacy of outsourced data is a serious concern.
Huda O. Mansour +6 more
wiley +1 more source
Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs [PDF]
Einst als Hilfssatz für Szemerédis Theorem entwickelt, hat sich das Regularitätslemma in den vergangenen drei Jahrzehnten als eines der wichtigsten Werkzeuge der Graphentheorie etabliert. Im Wesentlichen hat das Lemma zum Inhalt, dass dichte Graphen
Hàn, Hiêp
core +2 more sources
Decomposing tournaments into paths
Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo +3 more
wiley +1 more source

