Results 41 to 50 of about 39,607 (176)
Coulomb branch algebras via symplectic cohomology
Journal of Topology, Volume 19, Issue 2, June 2026.Abstract Let (M¯,ω)$(\bar{M}, \omega)$ be a compact symplectic manifold with convex boundary and c1(TM¯)=0$c_1(T\bar{M})=0$. Suppose that (M¯,ω)$(\bar{M}, \omega)$ is equipped with a convex Hamiltonian G$G$‐action for some connected, compact Lie group G$G$.
Eduardo González +2 more
wiley +1 more source
Preimage and pseudo collision attacks on round-reduced DHA-256 hash function
Tongxin xuebao, 2013 A preimage attack on DHA-256 hash function reduced to 37-round and a pseudo collision attack on the func-tion reduced to 39-round were proposed respectively.Based on the meet-in-the-middle attack,the Biclique technique was used to improve the preimage ...
Jian ZOU +3 more
doaj +2 more sources
A Novel of neutrosophic τ -Structure Ring ExtB and ExtV Spaces [PDF]
Neutrosophic Sets and Systems, 2020 In this paper, the concepts of a neutrosophic τ -structure ring spaces, neutrosophic τ -structure ring GδT1/2 spaces and neutrosophic τ -structure ring exterior B spaces and neutrosophic τ -structure ring exterior V spaces are introduced.
R. Narmada Devi
doaj +1 more source
Dynamics towards the Feigenbaum attractor
, 2007 We expose at a previously unknown level of detail the features of the dynamics of trajectories that either evolve towards the Feigenbaum attractor or are captured by its matching repellor. Amongst these features are the following: i) The set of preimages
A. Robledo +5 more
core +2 more sources
An extended definition of Anosov representation for relatively hyperbolic groups
Journal of Topology, Volume 19, Issue 2, June 2026.Abstract We define a new family of discrete representations of relatively hyperbolic groups which unifies many existing definitions and examples of geometrically finite behavior in higher rank. The definition includes the relative Anosov representations defined by Kapovich–Leeb and Zhu, and Zhu–Zimmer, as well as holonomy representations of various ...
Theodore Weisman
wiley +1 more source
Response Curves and Preimage Sequences of Two-Dimensional Cellular Automata [PDF]
, 2011 We consider the problem of finding response curves for a class of binary two-dimensional cellular automata with $L$-shaped neighbourhood. We show that the dependence of the density of ones after an arbitrary number of iterations, on the initial density ...
Fukś, Henryk, Skelton, Andrew
core +1 more source
Preimages Under the Stack-Sorting Algorithm [PDF]
Graphs and Combinatorics, 2016 We use a method for determining the number of preimages of any permutation under the stack-sorting map in order to obtain recursive upper bounds for the numbers $W_t(n)$ and $W_t(n,k)$ of $t$-stack sortable permutations of length $n$ and $t$-stack sortable permutations of length $n$ with exactly $k$ descents.
openaire +2 more sources
Degree theory for 4‐dimensional asymptotically conical gradient expanding solitons
Communications on Pure and Applied Mathematics, Volume 79, Issue 5, Page 1151-1298, May 2026.Abstract We develop a new degree theory for 4‐dimensional, asymptotically conical gradient expanding solitons. Our theory implies the existence of gradient expanding solitons that are asymptotic to any given cone over S3$S^3$ with non‐negative scalar curvature. We also obtain a similar existence result for cones whose link is diffeomorphic to S3/Γ$S^3/\
Richard H. Bamler, Eric Chen
wiley +1 more source
Preimage Attacks on the Round-reduced Keccak with Cross-linear Structures
IACR Transactions on Symmetric Cryptology, 2017 In this paper, based on the work pioneered by Aumasson and Meier, Dinur et al., and Guo et al., we construct some new delicate structures from the roundreduced versions of Keccakhash function family. The new constructed structures are called cross-linear
Ting Li +3 more
doaj +1 more source
Computing metric hulls in graphs
, 2018 We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This confirms a conjecture of Albenque and Knauer and implies that there is a polynomial time algorithm to ...
Knauer, Kolja, Nisse, Nicolas
core +3 more sources