Results 81 to 90 of about 4,202,174 (239)
Homological Lie brackets on moduli spaces and pushforward operations in twisted K‐theory
Journal of Topology, Volume 18, Issue 2, June 2025.Abstract We develop a general theory of pushforward operations for principal G$G$‐bundles equipped with a certain type of orientation. In the case G=BU(1)$G={B\mathrm{U}(1)}$ and orientations in twisted K‐theory, we construct two pushforward operations, the projective Euler operation, whose existence was conjectured by Joyce, and the projective rank ...
Markus Upmeier
wiley +1 more source
Journal of Topology, Volume 18, Issue 2, June 2025.Abstract We solve a motivic version of the Adams conjecture with the exponential characteristic of the base field inverted. In the way of the proof,, we obtain a motivic version of mod k$k$ Dold theorem and give a motivic version of Brown's trick studying the homogeneous variety (NGLrT)∖GLr$(N_{\mathrm{GL}_r} T)\backslash \mathrm{GL}_r$ which turns out
Alexey Ananyevskiy +3 more
wiley +1 more source
The Hilton–Milnor theorem in higher topoi
Bulletin of the London Mathematical Society, Volume 57, Issue 5, Page 1468-1481, May 2025.Abstract In this note, we show that the classical theorem of Hilton–Milnor on finite wedges of suspension spaces remains valid in an arbitrary ∞$\infty$‐topos. Our result relies on a version of James' splitting proved in [Devalapurkar and Haine, Doc. Math.
Samuel Lavenir
wiley +1 more source
Free products with amalgamation of monoids
Journal of Pure and Applied Algebra, 1998 A theorem of Bourbaki on free products with amalgamation of monoids is reproved here using techniques from string rewriting; it is based on a method due to \textit{T. Evans} [in Word problems II, Stud. Logic Found. Math. 95, 87-100 (1980; Zbl 0432.08004)].
openaire +2 more sources
On free inverse monoid languages [PDF]
RAIRO - Theoretical Informatics and Applications, 1996 Summary: This is a study on the class of \(\text{FIM}(X)\)-languages and its important subfamily consisting of inverse automata languages (\(i\)-languages). Both algebraic and combinatorial approaches are used to obtain several results concerning closure operators on \((X\cup X^{-1})^*\)-languages, including a classification of \(\text{FIM}(X ...
openaire +3 more sources
A generalized palindromization map in free monoids
Theoretical Computer Science, 2012 The palindromization map $ $ in a free monoid $A^*$ was introduced in 1997 by the first author in the case of a binary alphabet $A$, and later extended by other authors to arbitrary alphabets. Acting on infinite words, $ $ generates the class of standard episturmian words, including standard Arnoux-Rauzy words.
DE LUCA, ALDO, DE LUCA, ALESSANDRO
openaire +4 more sources
Discrete Event Systems Theory for Fast Stochastic Simulation via Tree Expansion
SystemsParatemporal methods based on tree expansion have proven to be effective in efficiently generating the trajectories of stochastic systems. However, combinatorial explosion of branching arising from multiple choice points presents a major hurdle that must
Bernard P. Zeigler
doaj +1 more source
Periodic endomorphisms of a free monoid
Semigroup Forum, 1995 An endomorphism \(\varphi \in \text{End} (X^*)\) of the finitely generated free monoid \(X^*\) is said to be periodic if the semigroup generated by \(\varphi\) is finite, i.e., if \(\varphi^m = \varphi^n\) for some \(m \neq n\). The author finds necessary and sufficient conditions for an endomorphism to be periodic, and a method is presented how to ...
openaire +3 more sources
Asymptotic properties of free monoid morphisms [PDF]
arXiv.org, 2015 É. Charlier, J. Leroy, M. Rigo
semanticscholar +1 more source