Results 101 to 110 of about 117,839 (222)
On the additive image of zeroth persistent homology
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer +3 more
wiley +1 more source
, 2019 The Burrows-Wheeler transform (BWT) is a permutation whose applications are prevalent in data compression and text indexing. The bijective BWT is a bijective variant of it that has not yet been studied for text indexing applications. We fill this gap by proposing a self-index built on the bijective BWT .
Hideo Bannai +3 more
openaire +3 more sources
A Bijective Proof for a Theorem of Ehrhart [PDF]
American Mathematical Monthly, 2009 We give a new proof for a theorem of Ehrhart regarding the quasi-polynomiality of the function that counts the number of integer points in the integral dilates of a rational polytope. The proof involves a geometric bijection, inclusion-exclusion, and recurrence relations, and we also prove Ehrhart reciprocity using these methods.
openaire +3 more sources
Rational points on even‐dimensional Fermat cubics
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract We show that even‐dimensional Fermat cubic hypersurfaces are rational over any field of characteristic not equal to three, by constructing explicit rational parameterizations with polynomials of low degree. As a byproduct of our rationality constructions, we obtain estimates for the number of their rational points over a number field and ...
Alex Massarenti
wiley +1 more source
Combinatorial Generation Algorithms for Directed Lattice Paths
MathematicsGraphs are a powerful tool for solving various mathematical problems. One such task is the representation of discrete structures. Combinatorial generation methods make it possible to obtain algorithms that can create discrete structures with specified ...
Yuriy Shablya +2 more
doaj +1 more source
On the automorphisms of the power semigroups of a numerical semigroup
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract If H$H$ is a numerical semigroup (i.e., a cofinite subset of the non‐negative integers closed under addition), then the collection of all non‐empty subsets of H$H$ forms a semigroup P(H)$\mathcal {P}(H)$ under the sumset operation induced by addition in H$H$.
Salvatore Tringali, Kerou Wen
wiley +1 more source
Block circulant graphs and the graphs of critical pairs of crowns
Electronic Journal of Graph Theory and Applications, 2019 In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns.
Rebecca E. Garcia +3 more
doaj +1 more source
A bijection for the evolution of $B$-trees
CoRR17 pages, 2 figures, accepted by 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)
Burghart, Fabian, Wagner, Stephan
openaire +6 more sources
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
Communications on Pure and Applied Mathematics, Volume 79, Issue 8, Page 1973-2102, August 2026.ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
Pattern Avoidance and the Fundamental Bijection
The Electronic Journal of CombinatoricsThe fundamental bijection is a bijection $\theta:\mathcal{S}_n\to\mathcal{S}_n$ in which one uses the standard cycle form of one permutation to obtain another permutation in one-line form. In this paper, we enumerate the set of permutations $\pi\in\mathcal{S}_n$ that avoids a pattern $\sigma\in\mathcal{S}_3$, whose image $\theta(\pi)$ also avoids ...
Kassie Archer, Robert P. Laudone
openaire +2 more sources