Related papers: A fast coset-translation algorithm for computing t…
Simple cycles, also known as self-avoiding polygons, are cycles on graphs which are not allowed to visit any vertex more than once. We present an exact formula for enumerating the simple cycles of any length on any directed graph involving…
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
We give a simple algebraic description of opetopes in terms of chain complexes, and we show how this description is related to combinatorial descriptions in terms of treelike structures. More generally, we show that the chain complexes…
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…
In this paper, we propose and investigate algorithms for the structured orthogonal dictionary learning problem. First, we investigate the case when the dictionary is a Householder matrix. We give sample complexity results and show…
Periodic orbit theory provides two important functions---the dynamical zeta function and the spectral determinant for the calculation of dynamical averages in a nonlinear system. Their cycle expansions converge rapidly when the system is…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…
We present an algebraic structure in modules over integer rings with cardinality prime powers, which allows to define bases. With such structure, we prove a similar version for the basis extension theorem of linear algebra over fields.…
One of the best understood families of logarithmic conformal field theories is that consisting of the (1,p) models (p = 2, 3, ...) of central charge c_{1,p} = 1 - 6 (p-1)^2 / p. This family includes the theories corresponding to the singlet…
We present new, unified proofs for the cell-like, $\mathbb{Z}/p$-, and $\mathbb{Q}$-resolution theorems. Our arguments employ extensions that are much simpler then those used by our predecessors. The techniques allow us to solve problems…
To extend rational materials design and discovery into the space of metastable polymorphs, rapid and reliable assessment of their lifetimes is essential. Motivated by the early work of Buerger (1951), here we investigate the routes to…
When designing an algorithm, one cares about arithmetic/computational complexity, but data movement (I/O) complexity plays an increasingly important role that highly impacts performance and energy consumption. For a given algorithm and a…
Modeling the structure of coherent texts is a key NLP problem. The task of coherently organizing a given set of sentences has been commonly used to build and evaluate models that understand such structure. We propose an end-to-end…
Dual decomposition provides a tractable framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However, for many real-world inference problems, the typical decomposition has a large…
Linear-time computational techniques have been developed for combining evidence which is available on a number of contending hypotheses. They offer a means of making the computation-intensive calculations involved more efficient in certain…
In answer set programming (ASP), a problem at hand is solved by (i) writing a logic program whose answer sets correspond to the solutions of the problem, and by (ii) computing the answer sets of the program using an answer set solver as a…
Real world arrays often contain underlying structure, such as sparsity, runs of repeated values, or symmetry. Specializing for structure yields significant speedups. But automatically generating efficient code for structured data is…
Constructor rewriting systems are said to be cons-free if any constructor term occurring in the rhs of a rule must be a subterm of the lhs of the rule. Roughly, such systems cannot build new data structures during their evaluation. In…
The notion of a modified Rota-Baxter algebra comes from the combination of those of a Rota-Baxter algebra and a modified Yang-Baxter equation. In this paper, we first construct free modified Rota-Baxter algebras. We then equip a free…
We study the problem of finding a minimum homology basis, that is, a lightest set of cycles that generates the $1$-dimensional homology classes with $\mathbb{Z}_2$ coefficients in a given simplicial complex $K$. This problem has been…