Results 71 to 80 of about 39,607 (176)
TOPOLOGICAL ENTROPY AND THE PREIMAGE STRUCTURE OF MAPS [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2012 Aim this article to provide an accessible introduction to the notion of topological entropy and (for context) its measure theoretic analogue, and then to present some work applying related ideas to the structure of iterated preimages for a continuous (in
Alaa A.Awad
doaj +1 more source
Homomorphic preimages of geometric paths
Discussiones Mathematicae Graph Theory, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Simplification of exponential factors of irregular connections on P1${\mathbb {P}}^1$
Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.Abstract We give an explicit algorithm to reduce the ramification order of any exponential factor of an irregular connection on P1$\mathbb {P}^1$, using the same types of basic operations as in the Katz–Deligne–Arinkin algorithm for rigid irregular connections.
Jean Douçot
wiley +1 more source
Fusion systems related to polynomial representations of SL2(q)$\operatorname{SL}_2(q)$
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract Let q$q$ be a power of a fixed prime p$p$. We classify up to isomorphism all simple saturated fusion systems on a certain class of p$p$‐groups constructed from the polynomial representations of SL2(q)$\operatorname{SL}_2(q)$, which includes the Sylow p$p$‐subgroups of GL3(q)$\mathrm{GL}_3(q)$ and Sp4(q)$\mathrm{Sp}_4(q)$ as special cases.
Valentina Grazian +3 more
wiley +1 more source
Monotone preimages of dendrites
Topology and its Applications, 2009 In 1991, J. J. Charatonik and K. Omiljanowski proved the following result: ``Let \(Y\) be a dendrite such that (1) all ramification points of \(Y\) are of order three; (2) the set \(R(X)\) is discrete. If a dendrite \(X\) can be mapped onto \(Y\) by a monotone mapping, then \(X\) contains a homeomorphic copy of \(Y\).'' In this paper the author gives a
openaire +2 more sources
Coding and anticoding of a cardinal by bounded subsets of the cardinal
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract This paper will consider combinatorial properties related to coding a cardinal by its bounded subsets. These properties have traditionally been studied in the context of very large cardinals and variations of these properties either reach the level of Kunen inconsistency or are very close to it.
William Chan
wiley +1 more source
Constructing Efficient Identity-Based Signatures on Lattices
IET Information SecurityIn this work, we explore the recent developments related to lattice-based signature and preimage sampling, and specify a compact identity-based signature (IBS) on an ideal lattice for practical use.
Huiwen Jia +3 more
doaj +1 more source
On topological groups with a weak q-point
Applied General TopologyIn this article, firstly, we introduce the concepts of weak q-spaces and weak sq-spaces. Some properties of these spaces are discussed. Secondly, we study weak q-spaces and weak sq-spaces in topological groups in terms of preimages of submetrizable ...
Hai-Hua Lin, Li-Hong Xie
doaj +1 more source
Osculating geometry and higher‐order distance Loci
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first‐order tangency. We focus on the data locus of points possessing at least one critical point of the distance function ...
Sandra Di Rocco +2 more
wiley +1 more source
On the image of Euler's totient function
, 2009 In this article we study certain properties of the image of Euler's totient function; we also consider the structure of the preimage of certain elements of the image of this ...
Coleman, Rodney
core +1 more source