Results 81 to 90 of about 2,222 (156)
On the maximum likelihood degree of Gaussian graphical models
Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.Abstract In this paper we revisit the likelihood geometry of Gaussian graphical models. We give a detailed proof that the ML‐degree behaves monotonically on induced subgraphs. Furthermore, we complete a missing argument that the ML‐degree of the nth$n{\rm th}$ cycle is larger than 1 for any n⩾4$n\geqslant 4$, therefore completing the characterization ...
Carlos Améndola +3 more
wiley +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
Image (Pre-image) Homomorfisme Interior Subgrup Fuzzy
Jurnal Fourier, 2019 Dalam makalah ini, akan diperkenalkan notasi image (pre-image) di bawah homomorfisma grup, dan akan dibuktikan image (pre-image) interior subgrup fuzzy (interior subgrup) di bawah homomorfisma grup selalu interior subgrup fuzzy (interior subgrup). [In
Saman Abdurrahman
doaj +1 more source
On the geometry of WDVV equations and their Hamiltonian formalism in arbitrary dimension
Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.Abstract It is known that in low dimensions Witten–Dijkgraaf–Verlinde–Verlinde (WDVV) equations can be rewritten as commuting quasilinear bi‐Hamiltonian systems. We extend some of these results to arbitrary dimension N$N$ and arbitrary scalar product η$\eta$.
S. Opanasenko, R. Vitolo
wiley +1 more source
Practical (Second) Preimage Attacks on TCS_SHA-3 [PDF]
, 2013 TCS\_SHA-3 is a family of four cryptographic hash functions that are covered by an US patent (US 2009/0262925). The digest sizes are 224, 256, 384 and 512 bits.
Gautham Sekar, Soumyadeep Bhattacharya
core +1 more source
Preimage and collision attacks on reduced Ascon using algebraic strategies
CybersecurityAscon, a family of algorithms that supports hashing and authenticated encryption, is the winner of the NIST Lightweight Cryptography Project. In this paper, we propose an improved preimage attack against 2-round Ascon-XOF-64 with a complexity of $$2^{33}$
Qinggan Fu +3 more
doaj +1 more source
A Fuzzy ^- ideal of aBH- algebra
Journal of Kufa for Mathematics and Computer, 2017 In this paper, we introduce the notions of - ideal of a ℬℋ-algebra in ordinary and fuzzy senses. Also, we give some properties of them and link these notions with some types of ideals of ℬℋ- algebra in ordinary and fuzzy senses .The image and ...
Karrar Deiaa Mohamed
doaj +1 more source
Hybrid KEM constructions from classical PKEs and post-quantum KEMs
CybersecurityThe rapid progress of quantum computing threatens widely deployed public-key cryptosystems such as RSA and Diffie–Hellman, accelerating the transition toward post-quantum cryptography (PQC).
Biming Zhou +3 more
doaj +1 more source
Preimages for the Tillich-Zémor Hash Function [PDF]
, 2011 After 15 years of unsuccessful cryptanalysis attempts by the research community, Grassl et al. have recently broken the collision resistance property of the Tillich-Zemor hash function. In this paper, we extend their cryptanalytic work and consider the preimage resistance of the function.
Christophe Petit 0001 +1 more
openaire +2 more sources
Differentiability Properties of the Pre-Image Pressure
Discrete Dynamics in Nature and Society, 2012 We study the differentiability properties of the pre-image pressure. For a TDS (X,T) with finite topological pre-image entropy, we prove the pre-image pressure function Ppre(T,•) is Gateaux differentiable at f∈C(X,R) if and only if Ppre(T,•) has a unique
Kesong Yan, Fanping Zeng, Gengrong Zhang
doaj +1 more source