Results 1 to 10 of about 58,054 (324)

Fundamental groups, slalom curves and extremal length [PDF]

, 2017
We define the extremal length of elements of the fundamental group of the twice punctured complex plane and give upper and lower bounds for this invariant. The bounds differ by a multiplicative constant.
Jöricke, Burglind
core   +4 more sources

Extremal length in higher dimensions and complex systolic inequalities [PDF]

, 2020
Extremal length is a classical tool in 1-dimensional complex analysis for building conformal invariants. We propose a higher-dimensional generalization for complex manifolds and provide some ideas on how to estimate and calculate it.
Pacini, Tommaso
core   +4 more sources

Extremal Values of Second Zagreb Index of Unicyclic Graphs Having Maximum Cycle Length: Two New Algorithms [PDF]

Mathematics
It is well-known that the necessary and sufficient condition for a connected graph to be unicyclic is that its omega invariant, a recently introduced graph invariant useful in combinatorial and topological calculations, is zero.
Hacer Ozden Ayna
doaj   +2 more sources

From curves to currents

Forum of Mathematics, Sigma, 2021
Many natural real-valued functions of closed curves are known to extend continuously to the larger space of geodesic currents. For instance, the extension of length with respect to a fixed hyperbolic metric was a motivating example for the development of
Dídac Martínez-Granado, Dylan P. Thurston   +1 more
doaj   +1 more source

Extremal length and Dirichlet problem on Klein surfaces [PDF]

Opuscula Mathematica, 2019
The object of this paper is to extend the method of extremal length to Klein surfaces by solving conformally invariant extremal problems on the complex double.
Monica Roşiu
doaj   +1 more source

Extremal Binary and Ternary Codes of Length 60 with an Automorphism of Order 29 and a Generalization

Mathematics, 2022
In this paper, all extremal Type I and Type III codes of length 60 with an automorphism of order 29 are classified up to equivalence. In both cases, it has been proven that there are three inequivalent codes.
Stefka Bouyuklieva, Javier de la Cruz, Darwin Villar   +2 more
doaj   +1 more source

Extremal Digraphs Avoiding Distinct Walks of Length 4 with the Same Endpoints

Discussiones Mathematicae Graph Theory, 2022
Let n ≥ 8 be an integer. We characterize the extremal digraphs of order n with the maximum number of arcs avoiding distinct walks of length 4 with the same endpoints.
Lyu Zhenhua
doaj   +1 more source

The maximum number of $P_\ell$ copies in $P_k$-free graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
Generalizing Tur\'an's classical extremal problem, Alon and Shikhelman investigated the problem of maximizing the number of $T$ copies in an $H$-free graph, for a pair of graphs $T$ and $H$.
Ervin Győri, Nika Salia, Casey Tompkins, Oscar Zamora   +3 more
doaj   +1 more source

On the spectral radius and energy of signless Laplacian matrix of digraphs

Heliyon, 2022
Let D be a digraph of order n and with a arcs. The signless Laplacian matrix Q(D) of D is defined as Q(D)=Deg(D)+A(D), where A(D) is the adjacency matrix and Deg(D) is the diagonal matrix of vertex out-degrees of D.
Hilal A. Ganie, Yilun Shang
doaj   +1 more source

Minimal Length Effect on Thermodynamics and Weak Cosmic Censorship Conjecture in Anti-de Sitter Black Holes via Charged Particle Absorption

Advances in High Energy Physics, 2020
In this paper, we investigate the minimal length effects on the thermodynamics and weak cosmic censorship conjecture in a RN-AdS black hole via charged particle absorption.
Benrong Mu, Jun Tao, Peng Wang
doaj   +1 more source