Results 61 to 70 of about 344,286 (183)
Partition Resolvability of Nanosheet and Nanotube Derived from Octagonal Grid
Journal of MathematicsChemical graph theory, a branch of computational and applied mathematics, covers a very wide range of topics. As a result, the world of applied sciences heavily relies on graph theory.
Ali Al Khabyah +2 more
doaj +1 more source
Superstrings in thermal anti-de Sitter space
Journal of High Energy Physics, 2021 We revisit the calculation of the thermal free energy for string theory in three-dimensional anti-de Sitter spacetime with Neveu-Schwarz-Neveu-Schwarz flux.
Sujay K. Ashok, Jan Troost
doaj +1 more source
Double Scaling Limits, Airy Functions and Multicritical Behaviour in O(N) Vektor Sigma Models [PDF]
, 1995 O(N) vector sigma models possessing catastrophes in their action are studied. Coupling the limit N --> infinity with an appropriate scaling behaviour of the coupling constants, the partition function develops a singular factor. This is a generalized Airy
Maeder, J., Ruehl, W.
core +1 more source
Embedding in $q$-ary $1$-perfect codes and partitions
, 2014 We prove that every $1$-error-correcting code over a finite field can be embedded in a $1$-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting $1$-perfect code and can be obtained from ...
Krotov, Denis S., Sotnikova, Evgeniya V.
core +1 more source
Sharp bounds for partition dimension of generalized Möbius ladders
Open Mathematics, 2018 The concept of minimal resolving partition and resolving set plays a pivotal role in diverse areas such as robot navigation, networking, optimization, mastermind games and coin weighing.
Hussain Zafar +4 more
doaj +1 more source
Reduced-Dimension Wiener Filter Based on Perpendicular Partition
IEEE Access, 2019 This paper addresses the reduced-dimension Wiener filter based on perpendicular partition. Two algorithms, i.e., cyclic per-weight (CPW) and batch CPW (BCPW) are presented, which can efficiently perform reduced-dimension adaptive beamforming.
Tuanning Liu +2 more
doaj +1 more source
Minimum Partition of an r−Independence System
Journal of Mathematics, 2021 Graph partitioning has been studied in the discipline between computer science and applied mathematics. It is a technique to distribute the whole graph data as a disjoint subset to a different device.
Zill-e-Shams +3 more
doaj +1 more source
THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2
BarekengSuppose is a connected graph with elements of a set of vertices denoted by and a subset of . The distance between and is the shortest distance to every vertex in . Let be a partition of , where each subset belongs to .
Jaya Santoso, Darmaji Darmaji
doaj +1 more source
Block Partitions in Higher Dimensions
Discrete & Computational GeometryAbstract Consider a set $$X\subseteq {\mathbb {R}}^d$$ X ⊆ R d
openaire +2 more sources
Two hard spheres in a spherical pore: Exact analytic results in two and three dimensions
, 2008 The partition function and the one- and two-body distribution functions are evaluated for two hard spheres with different sizes constrained into a spherical pore. The equivalent problem for hard disks is addressed too.
Urrutia, Ignacio
core +1 more source