Results 21 to 30 of about 158,996 (288)
Construction of extremal Type II $\mathbb{Z}_{2k}$-codes [PDF]
We give methods for constructing many self-dual $\mathbb{Z}_m$-codes and Type II $\mathbb{Z}_{2k}$-codes of length $2n$ starting from a given self-dual $\mathbb{Z}_m$-code and Type II $\mathbb{Z}_{2k}$-code of length $2n$, respectively. As an application, we construct extremal Type II $\mathbb{Z}_{2k}$-codes of length $24$ for $k=4,5,\ldots,20$ and ...
arxiv +1 more source
The method of extremal length [PDF]
Extremal length has become a useful tool in a wide variety of areas. The roots of the method can be traced back to the length-area comparisons in L. Ahlfors [1] and 5Warschawski [3], to the strip method of H. Grotzsch [1]-[15], and to even earlier works (see J. Jenkins [4, p. 7ff.] for a more complete historical background).
openaire +3 more sources
Robin Capacity and Extremal Length
Peer ...
Duren P. ,, Pfaltzgraff J.
openaire +3 more sources
Entwinement was first introduced as the CFT dual to extremal, non-minimal geodesics of quotiented AdS3 spaces. It was heuristically meant to capture the entanglement of internal, gauged degrees of freedom, for instance in the symmetric product orbifold ...
Ben Craps+2 more
doaj +1 more source
The complexity of deciding whether a graph admits an orientation with fixed weak diameter [PDF]
An oriented graph $\overrightarrow{G}$ is said weak (resp. strong) if, for every pair $\{ u,v \}$ of vertices of $\overrightarrow{G}$, there are directed paths joining $u$ and $v$ in either direction (resp. both directions).
Julien Bensmail+2 more
doaj +1 more source
Extremal lengths on Denjoy domains [PDF]
We consider the problem of computing the extremal lengths of certain homotopy classes of curves in certain symmetric surfaces. Specifically, we concentrate on plane domains which are conformal to the Riemann sphere with a collection of slits in the real axis removed; such a conformal type is called a Denjoy domain.
openaire +2 more sources
Extreme Lengths in Brownian and Bessel Excursions [PDF]
VI ( t) >~ V2(t) 0 ? . ??Vn(t) 3 . , (1.1) the ordered excursion lengths of R over (0, t), the last zero-free interval (A-(t), t) being considered as an (incomplete) excursion interval. Discussions on excursion intervals excluding (A-(t), t) are postponed to Section 5.
Hu, Yueyun, Shi, Zhan
openaire +3 more sources
The dual of non-extremal area: differential entropy in higher dimensions
The Ryu-Takayanagi formula relates entanglement entropy in a field theory to the area of extremal surfaces anchored to the boundary of a dual AdS space. It is interesting to ask if there is also an information theoretic interpretation of the areas of non-
Vijay Balasubramanian, Charles Rabideau
doaj +1 more source
EXTREMAL IOTA ENERGY OF A SUBCLASS OF TRICYCLIC DIGRAPHS AND SIDIGRAPHS [PDF]
The iota energy of an n-vertex digraph D is defined by Ec (𝐷) = ∑ 1 |Im(𝑧 k)|, where z1, . . ., zn are eigenvalues of D and Im(zk) is the imaginary part of eigenvalue zk . The iota energy of an n-vertex sidigraph can be defined analogously.
Fareeha Jamal, Mehtab Khan
doaj +1 more source
Choosing Wavelet Methods, Filters, and Lengths for Functional Brain Network Construction. [PDF]
Wavelet methods are widely used to decompose fMRI, EEG, or MEG signals into time series representing neurophysiological activity in fixed frequency bands.
Zitong Zhang+4 more
doaj +1 more source