Results 101 to 110 of about 235,976 (317)
Cartesian products avoiding patterns [PDF]
The pattern avoidance problem seeks to construct a set with large fractal dimension that avoids a prescribed pattern, such as three term arithmetic progressions, or more general patterns such as finding a set whose Cartesian product avoids the zero set of a given function.
openaire +2 more sources
Overcoming the bandwidth, latency, and power constraints of wired interconnects in multicore processing units, this work introduces a terahertz wireless solution featuring a dual‐carrier modular phased‐array transmitter and a novel 2D semiconductor quantum‐well nanoreceiver.
Kosala Herath +5 more
wiley +1 more source
Power domination of the cartesian product of graphs
In this paper, we first give a brief survey on the power domination of the Cartesian product of graphs. Then we conjecture a Vizing-like inequality for the power domination problem, and prove that the inequality holds when at least one of the two graphs ...
K.M. Koh, K.W. Soh
doaj +1 more source
A dimensional property of Cartesian product [PDF]
We show that the Cartesian product of three hereditarily infinite dimensional compact metric spaces is never hereditarily infinite dimensional. It is quite surprising that the proof of this fact (and this is the only proof known to the author) essentially relies on algebraic topology.
openaire +3 more sources
Strong resonant amplification in polarization anisotropy in third harmonic generation (THG) response from isolated MoS2 disks with small structural ellipticity introduced during fabrication is reported. This is attributed to the high refractive index of the MoS2 disk that supports characteristic anapole resonances combined with the cubic dependence of ...
Asish Prosad +3 more
wiley +1 more source
The exponent of Cartesian product of cycles
AbstractA digraph D is primitive if for each pair of vertices v,w of D, there is a positive integer k such that there is a directed walk of length k from v to w. The minimum of such k is the exponent of D. In this paper, we show that for a primitive graph G and a strongly connected bipartite digraph D, the exponent of the Cartesian product G×D is equal
Woonjae Hwang +2 more
openaire +2 more sources
Invoking a Cartesian Product Structure on Social States: New Resolutions of Sen's and Gibbard's Impossibility Theorems [PDF]
The purpose of this article is to introduce a Cartesian product structure into the social choice theoretical framework and to examine if new possibility results to Gibbard's and Sen's paradoxes can be developed thanks to it.
Herrade Igersheim
core
Bound States in the Continuum in Metasurface Absorbers: A Comparison with Metasurfaces
Bound states in the continuum (BICs) offer a powerful mechanism for enhancing light–matter interactions. This work systematically investigates the radiation characteristics of BICs under both transmission and reflection configurations using multipolar analysis.
Guizhen Xu +3 more
wiley +1 more source
On Path-Pairability in the Cartesian Product of Graphs
We study the inheritance of path-pairability in the Cartesian product of graphs and prove additive and multiplicative inheritance patterns of path-pairability, depending on the number of vertices in the Cartesian product.
Mészáros Gábor
doaj +1 more source
Distance Measurements Related to Cartesian Product of Cycles
Graph theory and its wide applications in natural sciences and social sciences open a new era of research. Making the graph of computer networks and analyzing it with aid of graph theory are extensively studied and researched in the literature.
Xiaoli Qiang +5 more
doaj +1 more source

