English
Related papers

Related papers: Necklaces and bracelets in R

200 papers

We present a dataset and experiments on applying recurrent neural networks (RNNs) for guiding clause selection in the connection tableau proof calculus. The RNN encodes a sequence of literals from the current branch of the partial proof…

Artificial Intelligence · Computer Science 2020-04-10 Bartosz Piotrowski , Josef Urban

While the problem of knot classification is far from solved, it is possible to create computer programs that can be used to tabulate knots up to a desired degree of complexity. Here we discuss the main ideas on which such programs can be…

q-alg · Mathematics 2008-02-03 Charilaos Aneziris

Analytical methods for finding moments of random Vandermonde matrices with entries on the unit circle are developed. Vandermonde Matrices play an important role in signal processing and wireless applications such as direction of arrival…

Information Theory · Computer Science 2016-08-14 Øyvind Ryan , Merouane Debbah

This report showcases the role of, and future directions for, the field of Randomized Numerical Linear Algebra (RNLA) in a selection of scientific applications. These applications span the domains of imaging, genomics and dynamical systems,…

Recurrent Neural Networks (RNNs) are a class of machine learning algorithms used for applications with time-series and sequential data. Recently, there has been a strong interest in executing RNNs on embedded devices. However, difficulties…

Neural and Evolutionary Computing · Computer Science 2020-03-23 Nesma M. Rezk , Madhura Purnaprajna , Tomas Nordström , Zain Ul-Abdin

A de Bruijn array code is a set of $r \times s$ binary doubly-periodic arrays such that each binary $n \times m$ matrix is contained exactly once as a window in one of the arrays. Such a set of arrays can be viewed as a two-dimensional…

Information Theory · Computer Science 2024-12-09 Tuvi Etzion

One of the key requirement of many schemes is that of random numbers. Sequence of random numbers are used at several stages of a standard cryptographic protocol. A simple example is of a Vernam cipher, where a string of random numbers is…

Computational Physics · Physics 2015-10-06 Ram Soorat , Madhuri K. , Ashok Vudayagiri

Let $R$ be an associative ring with identity and let $N$ be a nil ideal of $R$. It is shown that units of $R/N$ can be lifted to units in $R$. Under some mild conditions on the ring, a procedure is given to determine those lifted units in a…

Rings and Algebras · Mathematics 2020-04-30 F. D. de Melo Hernandez , César A. Hernández Melo , Horacio Tapia-Recillas

In this note we use the analogy between the Catalan sequence and the Rueppel sequence to derive a variety of conjectures surrounding the Hankel transforms of a number of sequences closely related to the Rueppel sequence. Use is made of the…

Combinatorics · Mathematics 2021-07-06 Paul Barry

Many models for complex phenomena use a model for strongly-interacting elements on a small scale to generate larger-scale simulations of some aspects of experimental realizations. These models may be agent-based (as in the case of discrete…

Soft Condensed Matter · Physics 2025-09-10 Jeffrey D. Picka

Monitoring data while it is processed and transformed can yield detailed insight into the dynamics of a (running) production system. The lumberjack package is a lightweight package allowing users to follow how an R object is transformed as…

Computation · Statistics 2025-12-30 Mark P. J. van der Loo

Interleaved Reed-Solomon codes are applied in numerous data processing, data transmission, and data storage systems. They are generated by interleaving several codewords of ordinary Reed-Solomon codes. Usually, these codewords are decoded…

Information Theory · Computer Science 2007-07-13 Georg Schmidt , Vladimir R. Sidorenko , Martin Bossert

Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis.…

Combinatorics · Mathematics 2018-11-08 María Carrasco , Zenaida Castillo , Nerio Borges , Ramón Pino Pérez

We address two variants of the classical necklace counting problem from enumerative combinatorics. In both cases, we fix a finite group $\mathcal{G}$ and a positive integer $n$. In the first variant, we count the ``identity-product…

Combinatorics · Mathematics 2025-12-25 Darij Grinberg , Peter Mao

In this paper we investigate enumeration of some classes of $n$-character strings and binary necklaces. Recall that binary necklaces are necklaces in two colors with length $n$. We prove three results (Theorems 1, 1' and 2) concerning the…

Combinatorics · Mathematics 2018-04-04 Romeo Meštrović

Knots and links which are closed 3-braids are a very special class. Like 2-bridge knots and links, they are simple enough to admit a complete classification. At the same time they are rich enough to serve as a source of examples on which,…

Geometric Topology · Mathematics 2008-05-14 Joan S. Birman , William W. Menasco

The current paper is a study in Recurrent Neural Networks (RNN), motivated by the lack of examples simple enough so that they can be thoroughly understood theoretically, but complex enough to be realistic. We constructed an example of…

Machine Learning · Statistics 2019-11-26 Marek Rychlik

Recurrent neural networks (RNNs) are a class of nonlinear dynamical systems often used to model sequence-to-sequence maps. RNNs have excellent expressive power but lack the stability or robustness guarantees that are necessary for many…

Machine Learning · Computer Science 2020-10-06 Max Revay , Ruigang Wang , Ian R. Manchester

CHR is a very versatile programming language that allows programmers to declaratively specify constraint solvers. An important part of the development of such solvers is in their testing and debugging phases. Current CHR implementations…

Define the complete n-complex on N vertices to be the n-skeleton of an (N-1)-simplex. We show that embeddings of sufficiently large complete n-complexes in R^{2n+1} necessarily exhibit complicated linking behaviour, thereby extending known…

Geometric Topology · Mathematics 2014-10-01 Christopher Tuffley