Results 11 to 20 of about 344,286 (183)

Brick partition problems in three dimensions [PDF]

open access: yesDiscrete Mathematics, 2021
A $d$-dimensional brick is a set $I_1\times \cdots \times I_d$ where each $I_i$ is an interval. Given a brick $B$, a brick partition of $B$ is a partition of $B$ into bricks. A brick partition $\mathcal{P}_d$ of a $d$-dimensional brick is $k$-piercing if every axis-parallel line intersects at least $k$ bricks in $\mathcal{P}_d$. Bucic et al. explicitly
Ilkyoo Choi, Minseong Kim, Kiwon Seo
openaire   +2 more sources

Fractal dimension computation from equal mass partitions [PDF]

open access: yesChaos: An Interdisciplinary Journal of Nonlinear Science, 2014
11 pages, 11 ...
Shiozawa, Yui   +2 more
openaire   +5 more sources

Anomalous dimensions from thermal AdS partition functions [PDF]

open access: yesJournal of High Energy Physics, 2020
Abstract We develop an efficient method for computing thermal partition functions of weakly coupled scalar fields in AdS. We consider quartic contact interactions and show how to evaluate the relevant two-loop vacuum diagrams without performing any explicit AdS integration, the key step being the use of Källén-Lehmann type ...
Kraus, Per   +2 more
openaire   +3 more sources

Fault-Tolerant Partition Resolvability in Mesh Related Networks and Applications

open access: yesIEEE 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 ...
Kamran Azhar   +4 more
doaj   +1 more source

Partition dimension and strong metric dimension of chain cycle

open access: yesDiscrete Applied Mathematics, 2020
Let $G$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. For an ordered $k$-partition $ =\{Q_1,\ldots,Q_k\}$ of $V(G)$, the representation of a vertex $v \in V(G)$ with respect to $ $ is the $k$-vectors $r(v| )=(d(v,Q_1),\ldots,d(v,Q_k))$, where $d(v,Q_i)$ is the distance between $v$ and $Q_i$.
Rehman, Talmeez Ur, Mehreen, Naila
  +9 more sources

On Partition Dimension of Generalized Convex Polytopes

open access: yesJournal of Mathematics, 2023
Let G be a graph having no loop or multiple edges, k−order vertex partition for G is represented by γ=γ1,γ2,…,γk. The vector rϕγ=dϕ,γ1,dϕ,γ2,dϕ,γ3⋯,dϕ,γk is the representation of vertex ϕ with respect to γ.
Syed Waqas Shah   +5 more
doaj   +1 more source

The Application of Fault-Tolerant Partition Resolvability in Cycle-Related Graphs

open access: yesApplied Sciences, 2022
The concept of metric-related parameters permeates all of graph theory and plays an important role in diverse networks, such as social networks, computer networks, biological networks and neural networks.
Kamran Azhar   +4 more
doaj   +1 more source

The connected partition dimension of truncated wheels

open access: yesAKCE International Journal of Graphs and Combinatorics, 2021
Let G be a connected graph. For a vertex v of G and a subset S of V(G), the distance between v and S is d(v, S) = min Given an ordered k-partition = of V(G), the representation of v with respect to is the k-vector If for each pair of distinct vertices ...
Lyndon L. Lazaro, Jose B. Rosario
doaj   +1 more source

Intrinsic Dimension Adaptive Partitioning for Kernel Methods

open access: yesSIAM Journal on Mathematics of Data Science, 2022
36 pages, 5 figures, 2 ...
Thomas Hamm, Ingo Steinwart
openaire   +2 more sources

Home - About - Disclaimer - Privacy