Related papers: An algorithm for computing root multiplicities in …
In this paper we consider the problem of encoding data into \textit{repeat-free} sequences in which sequences are imposed to contain any $k$-tuple at most once (for predefined $k$). First, the capacity of the repeat-free constraint are…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
We derive a formula for the the modular class of a Lie algebroid with a regular twisted Poisson structure in terms of a canonical Lie algebroid representation of the image of the Poisson map. We use this formula to compute the modular…
Recently the second named author discovered a combinatorial identity in the context of vertex representations of quantum Kac-Moody algebras. We give a direct and elementary proof of this identity. Our method is to show a related identity of…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
We describe Ccluster, a software for computing natural $\epsilon$-clusters of complex roots in a given box of the complex plane. This algorithm from Becker et al.~(2016) is near-optimal when applied to the benchmark problem of isolating all…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…
In this paper, by using the Lakshmibai-Seshadri paths, we give the branching rule for representations of affine Kac-Moody algebras to their winding subalgebras. As a corollary, we can describe branching multiplicities in the language of…
In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision…
We describe a connection between the subjects of cluster algebras, polynomial identity algebras and discriminants. For this, we define the notion of root of unity quantum cluster algebras and prove that they are polynomial identity…
We give a new procedure in Maple for finding the k-th power of a martix. The algorithm is based on the article [1].
A poly-log time method to compute the truncated theta function, its derivatives, and integrals is presented. The method is elementary, rigorous, explicit, and suited for computer implementation. We repeatedly apply the Poisson summation…
In this paper, we define binary block codes over subsets of real algebras obtained by the Cayley-Dickson process and we provide an algorithm to obtain codes with a better rate. This algorithm offers more flexibility than other methods known…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…
Connection matrices are a generalization of Morse boundary operators from the classical Morse theory for gradient vector fields. Developing an efficient computational framework for connection matrices is particularly important in the…
The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…
k-means is a widely used clustering algorithm, but for $k$ clusters and a dataset size of $N$, each iteration of Lloyd's algorithm costs $O(kN)$ time. Although there are existing techniques to accelerate single Lloyd iterations, none of…
The Kac-Moody correction factor, first studied by Macdonald in the affine case, corrects the failure of an identity found by Macdonald in finite-dimensional root systems in 1972. Subsequntly this factor appeared in several formulas in the…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
It is well-known that the spectral radius of a connected uniform hypergraph is an eigenvalue of the hypergraph. However, its algebraic multiplicity remains unknown. In this paper, we use the Poisson Formula and matching polynomials to…