English
Related papers

Related papers: In-Place Bijective Burrows-Wheeler Transforms

200 papers

Lyndon words are extensively studied in combinatorics on words -- they play a crucial role on upper bounding the number of runs a word can have [Bannai+, SIAM J. Comput.'17]. We can determine Lyndon words, factorize a word into Lyndon words…

Data Structures and Algorithms · Computer Science 2024-04-24 Diptarama Hendrian , Dominik Köppl , Ryo Yoshinaka , Ayumi Shinohara

The sampling based motion planning algorithm known as Rapidly-exploring Random Trees (RRT) has gained the attention of many researchers due to their computational efficiency and effectiveness. Recently, a variant of RRT called RRT* has been…

Robotics · Computer Science 2017-03-28 Ahmed Hussain Qureshi , Yasar Ayaz

We present the $CWR$ invariant, a new invariant for alternating links, which builds upon and generalizes the $WRP$ invariant. The $CWR$ invariant is an array of two-variable polynomials that provides a stronger invariant compared to the…

Geometric Topology · Mathematics 2025-05-27 Michal Jablonowski

An evolutionary form of a generalized Bayesian update method, which is strictly derivative- free yet directed through an additive update term based purely on the statistical moments of the design variables, is proposed for nonlinear inverse…

Methodology · Statistics 2013-12-17 M Venugopal , D Roy , R M Vasu

We propose a randomized multiplicative weight update (MWU) algorithm for $\ell_{\infty}$ regression that runs in $\widetilde{O}\left(n^{2+1/22.5} \text{poly}(1/\epsilon)\right)$ time when $\omega = 2+o(1)$, improving upon the previous best…

Data Structures and Algorithms · Computer Science 2025-04-29 Deeksha Adil , Shunhua Jiang , Rasmus Kyng

There have been many recent advances in the structure and measurement of distributed language models: those that map from words to a vector-space that is rich in information about word choice and composition. This vector-space is the…

Computation and Language · Computer Science 2015-07-27 Matt Taddy

We use Cramer's formula for the inverse of a matrix and a combinatorial expression for the determinant in terms of paths of an associated digraph (which can be traced back to Coates) to give a combinatorial interpretation of M\"obius…

Combinatorics · Mathematics 2024-07-23 Juan Pablo Vigneaux

We generalize the study of standard Lyndon loop words from [A.Negut, A.Tsymbaliuk, "Quantum loop groups and shuffle algebras via Lyndon words", Adv. Math. 439 (2024), Paper No. 109482] to a more general class of orders on the underlying…

Representation Theory · Mathematics 2025-02-24 Severyn Khomych , Nazar Korniichuk , Kostiantyn Molokanov , Alexander Tsymbaliuk

It is known that the writhe calculated from any reduced alternating link diagram of the same (alternating) link has the same value. That is, it is a link invariant if we restrict ourselves to reduced alternating link diagrams. This is due…

Geometric Topology · Mathematics 2020-09-29 Yuanan Diao , Van Pham

The core-EP and BT inverses for rectangular matrices were studied recently in the literature. The main aim of this paper is to unify both concepts by means of a new kind of generalized inverse called $W$-weighted $q$-BT inverse. We analyze…

Rings and Algebras · Mathematics 2024-03-22 D. E. Ferreyra , N. Thome , C. Torigino

In this paper we use the power of the outer exponential $\Lambda^B$ of a bivector $B$ to see the so-called invariant decomposition from a different perspective. This is deeply connected with the eigenvalues for the adjoint action of $B$, a…

Mathematical Physics · Physics 2025-10-16 David Eelbode , Martin Roelfs , Steven De Keninck

We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…

Rings and Algebras · Mathematics 2021-11-08 Johanna Lercher , Hans-Peter Schröcker

We use the method due to Batalin, Fradkin, Fradkina, and Tyutin (BFFT) in order to convert second-class into first-class constraints for some quantum mechanics supersymmetric theories. The main point to be considered is that the extended…

High Energy Physics - Theory · Physics 2009-10-30 J. Barcelos-Neto , W. Oliveira

The symplectic wavelet transformation [Opt. Lett. 31 (2006) 3432], which is related to quantum optical Fresnel transform, is developed to the symplectic-dilation mixed wavelet transform (SDWT). The SDWT involves both a real-variable…

Quantum Physics · Physics 2009-11-13 Hong-yi Fan , Shu-guang Liu , Li-yun Hu

The purpose of this paper is to present a certain combinatorial method of constructing invariants of isotopy classes of oriented tame links. This arises as a generalization of the known polynomial invariants of Conway and Jones. These…

Geometric Topology · Mathematics 2016-10-24 Jozef H. Przytycki , Pawel Traczyk

We present an efficient algorithm for finding all approximate occurrences of a given pattern $p$ of length $m$ in a text $t$ of length $n$ allowing for translocations of equal length adjacent factors and inversions of factors. The algorithm…

Data Structures and Algorithms · Computer Science 2013-05-09 Szymon Grabowski , Simone Faro , Emanuele Giaquinta

In order to invariantly characterise spacetimes resulting from cosmological simulations in numerical relativity, we present two different methodologies to compute the electric and magnetic parts of the Weyl tensor, $E_{\alpha\beta}$ and…

General Relativity and Quantum Cosmology · Physics 2023-06-21 Robyn L. Munoz , Marco Bruni

The Hamiltonian formulation of the BMS symmetry on spacelike hypersurfaces enables one to define its action on solutions of the Wheeler-DeWitt equation. Using the BRST reformulation of the theory, we provide operator expressions for the…

High Energy Physics - Theory · Physics 2025-06-04 Marc Henneaux

Transformers have emerged as the cornerstone of state-of-the-art natural language processing models, showcasing exceptional performance across a wide range of AI applications. However, the memory demands posed by the self-attention…

Computation and Language · Computer Science 2023-08-30 Hao Liu , Pieter Abbeel

We first review how we can store a run-length compressed suffix array (RLCSA) for a text $T$ of length $n$ over an alphabet of size $\sigma$ whose Burrows-Wheeler Transform (BWT) consists of $r$ runs in $O \left( \rule{0ex}{2ex} r \log (n /…

Data Structures and Algorithms · Computer Science 2025-04-22 Nathaniel K. Brown , Travis Gagie , Giovanni Manzini , Gonzalo Navarro , Marinella Sciortino
‹ Prev 1 8 9 10 Next ›