Results 161 to 170 of about 8,549 (260)

Thin‐film lithium niobate photonics: Frontiers in millimeter‐wave and terahertz generation and integrated applications

open access: yesInfoScience, EarlyView.
With the advancement of 6G communications, high‐precision radar, and advanced imaging technologies, there is a growing demand for compact, high‐performance light sources capable of generating high‐frequency radio waves (millimeter‐wave and terahertz waves). This article systematically introduces how to efficiently generate these high‐frequency waves on
Jianfeng Xiong   +8 more
wiley   +1 more source

On Quantum Ergodicity for Higher Dimensional Cat Maps. [PDF]

open access: yesCommun Math Phys
Kurlberg P   +3 more
europepmc   +1 more source

Mixed Steiner Triple Systems With Shortest Length

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT A mixed Steiner triple system is a 3‐GDD which is viewed as a code with minimum Hamming distance 3. These codes are the minimum weight codewords of a 1‐perfect code over a mixed alphabet, when the related codes exist, and provide the connection between 3‐GDDs and coding theory.
Tuvi Etzion
wiley   +1 more source

Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch   +5 more
wiley   +1 more source

Linear Versus Centred Colouring via Pseudogrids

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique. For a graph G $G$, the centred chromatic number χ cen ( G ) ${\chi }_{\text{cen}}(G)$
Prosenjit Bose   +4 more
wiley   +1 more source

Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley   +1 more source

Home - About - Disclaimer - Privacy