Results 131 to 140 of about 3,063 (228)
A bijection for the evolution of $B$-trees
17 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
Diameter-preserving linear bijections of function spaces [PDF]
, 2001 T. S. S. R. K. Rao, Anup Kumar Roy
openalex +1 more source
Factorizations and minimality of the Calkin Algebra norm for C(K)$C(K)$‐spaces
Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.Abstract For a scattered, locally compact Hausdorff space K$K$, we prove that the essential norm on the Calkin algebra B(C0(K))/K(C0(K))$\mathcal {B}(C_0(K))/\mathcal {K}(C_0(K))$ is a minimal algebra norm. The proof relies on establishing a quantitative factorization for the identity operator on c0$c_0$ through noncompact operators T:C0(K)→X$T: C_0(K)
Antonio Acuaviva
wiley +1 more source
A reduction theorem for the Character Triple Conjecture
Proceedings of the London Mathematical Society, Volume 131, Issue 4, October 2025.Abstract In this paper, we show that the Character Triple Conjecture holds for all finite groups once assumed for all quasi‐simple groups. This answers the question on the existence of a self‐reducing form of Dade's conjecture, a problem that was extensively investigated by Dade in the 1990s.
Damiano Rossi
wiley +1 more source
Crossing estimates for the Ising model on general s‐embeddings
Proceedings of the London Mathematical Society, Volume 131, Issue 4, October 2025.Abstract We prove Russo–Seymour–Welsh‐type crossing estimates for the FK–Ising model on general s‐embeddings whose origami map has an asymptotic Lipschitz constant strictly smaller than 1, provided it satisfies a mild non‐degeneracy assumption. This result extends the work of Chelkak and provides a general framework to prove that the usual connection ...
Rémy Mahfouf
wiley +1 more source
Bijections related to statistics on words
Discrete Mathematics, 1988 Consider throughout the collection \(M=M(n_ 1,...,n_ k)\) of all words \b{a}\(=a_ 1...a_ n\) containing \(n_ i\) i's, \(i\leq k\); define the inversion number Inv(\b{a}) to be the number of ordered pairs (i,j) such that \(ia_ j\), and the major index Maj(\b{a}) to be the sum of all j such that \(a_ j>a_{j+1}\). One of MacMahon's results was that \(| S|
openaire +3 more sources
Correction: Zhang, J.; Liu, K. Neural Information Squeezer for Causal Emergence. Entropy 2023, 25, 26. [PDF]
Entropy (Basel), 2023 Zhang J, Liu K.
europepmc +1 more source
Moments des q-Polynômes de Laguerre et la Bijection de Foata-Zeilberger
, 1994 A. Demedicis, Xavier Gérard Viennot
openalex +1 more source