Results 21 to 30 of about 74,479 (279)
Fault Tolerant Partition Resolvability in Convex Polytopes
Mathematical Problems in Engineering, 2022 Convex polytopes are special types of polytopes having an additional property that they are also convex sets in the n-dimensional Euclidean space. The convex polytope topologies are being used in the antitracking networks due to their stability, resilience, and destroy-resistance.
Asim Nadeem +3 more
openaire +1 more source
Subspace partitioning in human prefrontal cortex resolves cognitive interference
Proceedings of the National Academy of Sciences, 2022 AbstractHuman prefrontal cortex (PFC) constitutes the structural basis underlying flexible cognitive control, where mixed-selective neural populations encode multiple task-features to guide subsequent behavior. The mechanisms by which the brain simultaneously encodes multiple task-relevant variables while minimizing interference from task-irrelevant ...
Jan Weber +8 more
openaire +2 more sources
Separating decision tree complexity from subcube partition complexity [PDF]
, 2015 The subcube partition model of computation is at least as powerful as decision trees but no separation between these models was known. We show that there exists a function whose deterministic subcube partition complexity is asymptotically smaller than ...
Kothari, Robin +2 more
core +2 more sources
On The Partition Dimension of Disconnected Graphs
Journal of Mathematical and Fundamental Sciences, 2017 For a graph G=(V,E), a partition Ω=\{O_1,O_2,…,O_k \} of the vertex set V is called a resolving partition if every pair of vertices u,v∈V(G) have distinct representations under Ω.
Debi Oktia Haryeni +2 more
doaj +1 more source
On Sharp Bounds on Partition Dimension of Convex Polytopes
IEEE Access, 2020 Let $\Omega $ be a connected graph and for a given $l$ -ordered partition of vertices of a connected graph $\Omega $ is represented as $\beta =\{\beta _{1},\beta _{2}, {\dots },\beta _{l}\}$ . The representation of a vertex $\mu \in V(\Omega)$ is
Yu-Ming Chu +3 more
doaj +1 more source
Poincar\'e recurrence theorem and the strong CP-problem [PDF]
, 2006 The existence in the physical QCD vacuum of nonzero gluon condensates, such as $$, requires dominance of gluon fields with finite mean action density. This naturally allows any real number value for the unit ``topological charge'' $q$ characterising the ...
Alex C. Kalloniatis +5 more
core +2 more sources
A Note on (0,2) Models on Calabi-Yau Complete Intersections [PDF]
, 1998 In the class of (0,2) heterotic compactifications which has been constructed in the framework of gauged linear sigma models the Calabi-Yau varieties X are realized as complete intersections of hypersurfaces in toric varieties IP and the corresponding ...
Aspinwall +13 more
core +2 more sources
Fault-Tolerant Partition Resolvability in Mesh Related Networks and Applications
IEEE Access, 2022 Fault-tolerance of a system measures its working capability in the presence of faulty components in the system. The fault-tolerant partition dimension of a network computes the least number of subcomponents of network required to distinctively identify each node in the presence of faults, having promising applications in telecommunication, robot ...
Kamran Azhar +4 more
openaire +2 more sources
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Partition dimension was introduced as a part of interesting topic in graph theory. It was focus to observe about distance. The local partition dimension is an expansion of the partition dimension by adding certain conditions to the representation of the ...
Ilham Saifudin +2 more
doaj +1 more source
The quantization of the chiral Schwinger model based on the BFT-BFV formalism II [PDF]
, 1998 We apply an improved version of Batalin-Fradkin-Tyutin (BFT) Hamiltonian method to the a=1 chiral Schwinger Model, which is much more nontrivial than the a>1.$ one.
Banerjee R +16 more
core +3 more sources