Results 91 to 100 of about 3,991 (224)
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding internal BSTs into the nodes of an external BST—a structure motivated by parallel data architectures—corresponding to composite permutations formed via Kronecker or ...
John Peca‐Medlin, Chenyang Zhong
wiley +1 more source
Cluster algebras of infinite rank [PDF]
, 2014 Holm and Jørgensen have shown the existence of a cluster structure on a certain category D that shares many properties with finite type A cluster categories and that can be fruitfully considered as an infinite analogue of these. In this work we determine
Gratz, Sira +3 more
core +1 more source
Bayer noise quasisymmetric functions and some combinatorial algebraic structures [PDF]
Categories and General Algebraic Structures with ApplicationsRecently, quasisymmetric functions have been widely studied due to their big connection to enumerative combinatorics, combinatorial Hopf algebra and number theory.
Adnan Abdulwahid
doaj +1 more source
Which singular tangent bundles are isomorphic?
Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.Abstract Logarithmic and b$ b$‐tangent bundles provide a versatile framework for addressing singularities in geometry. Introduced by Deligne and Melrose, these modified bundles resolve singularities by reframing singular vector fields as well‐behaved sections of these singular bundles.
Eva Miranda, Pablo Nicolás
wiley +1 more source
A categorification of combinatorial Auslander–Reiten quivers
Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.Abstract We provide a categorification of Oh and Suh's combinatorial Auslander–Reiten quivers in the simply laced case. We work within the perfectly valued derived category pvd(ΠQ)$\mathrm{pvd}(\Pi _Q)$ of the 2‐dimensional Ginzburg dg algebra of a Dynkin quiver Q$Q$.
Ricardo Canesin
wiley +1 more source
Annalen der Physik, Volume 538, Issue 4, April 2026.The Prouhet‐Thue‐Morse (PTM) sequence emerges as a unifying thread across quantum error correction, noise‐resistant memories, spin‐chain dynamics, quantum chaos, and Dirichlet links to the Riemann zeta function. Mapping PTM‐encoded logical states onto qubit and qudit architectures uncovers symmetry‐protected resilience and multifractal signatures ...
Denis Janković +3 more
wiley +1 more source
Computational complexity in algebraic combinatorics
Current Developments in MathematicsNotes associated with the Current Developments in Mathematics 2023 ...
openaire +2 more sources
Homogeneous Algebras, Statistics and Combinatorics
Letters in Mathematical Physics, 2002 After some generalities on homogeneous algebras, we give a formula connecting the Poincaré series of a homogeneous algebra with the homology of the corresponding Koszul complex generalizing thereby a standard result for quadratic algebras. We then investigate two particular types of cubic algebras: The first one called the parafermionic (parabosonic ...
Dubois-Violette, Michel, Popov, Todor
openaire +3 more sources
Asymptotics of lattice walks via analytic combinatorics in several variables [PDF]
, 2016 We consider the enumeration of walks on the two-dimensional non-negative integer lattice with steps defined by a finite set S ⊆ {±1, 0}2 . Up to isomorphism there are 79 unique two-dimensional models to consider, and previous work in this area has used ...
Melczer, S, Wilson, Mark
core
Combinatorics of free vertex algebras [PDF]
Journal of Algebra, 2002 This paper illustrates the combinatorial approach to vertex algebra - study of vertex algebras presented by generators and relations. A necessary ingredient of this method is the notion of free vertex algebra. Borcherds \cite{bor} was the first to note that free vertex algebras do not exist in general. The reason for this is that vertex algebras do not
openaire +3 more sources