相关论文: Pseudocodewords from Bethe Permanents

Approximating the permanent of a complex-valued matrix is a fundamental problem with applications in Boson sampling and probabilistic inference. In this paper, we extend factor-graph-based methods for approximating the permanent of…

For a finite Coxeter group, a subword complex is a simplicial complex associated with a pair (Q, \pi), where Q is a word in the alphabet of simple reflections, $\pi$ is a group element. We discuss the transformations of such a complex…

Gender bias in word embeddings gradually becomes a vivid research field in recent years. Most studies in this field aim at measurement and debiasing methods with English as the target language. This paper investigates gender bias in static…

An important question concerning contextualized word embedding (CWE) models like BERT is how well they can represent different word senses, especially those in the long tail of uncommon senses. Rather than build a WSD system as in previous…

The note deals with the Gaudin model associated with the tensor product of n irreducible finite-dimensional sl_{N+1}-modules marked by distinct complex numbers z_1,..., z_n. The Bethe Ansatz is a method to construct common eigenvectors of…

The homological information about a filtered simplicial complex over the poset of positive real numbers is often presented by a barcode which depicts the evolution of the associated Betti numbers. However, there is a wonderfully complex…

Contextualized word embeddings, i.e. vector representations for words in context, are naturally seen as an extension of previous noncontextual distributional semantic models. In this work, we focus on BERT, a deep neural network that…

From the work of Bauer and Lesnick, it is known that there is no functor from the category of pointwise finite-dimensional persistence modules to the category of barcodes and overlap matchings. In this work, we introduce sub-barcodes and…

Semipositive matrices (matrices that map at least one nonnegative vector to a positive vector) and minimally semipositive matrices (semipositive matrices whose no column-deleted submatrix is semipositive) are well studied in matrix theory.…

A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…

The structure of Bethe vectors for generalised models associated with the XXX- and XXZ-type R-matrix is investigated. The Bethe vectors in terms of two--component and multi--component models are described. Consequently, their structure in…

The matrix representations of linear codes have been well-studied for use as disjunct matrices. However, no connection has previously been made between the properties of disjunct matrices and the parity-check codes obtained from them. This…

We define the bounded coarse structure attached to a family of pseudometrics and give some counterexamples to conjectures that arise naturally.

In recent years several classes of structured matrices are extended to classes of tensors in the context of tensor complementarity problem. The tensor complementarity problem is a class of nonlinear complementarity problem where the…

The concept of parity check matrices of linear binary codes has been extended by Heden [9] to parity check systems of nonlinear binary codes. In the present paper we extend this concept to parity check systems of nonlinear codes over finite…

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

The AWGNC, BSC, and max-fractional pseudocodeword redundancy of a code is defined as the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of the code.…

A list decoding algorithm for matrix-product codes is provided when $C_1,..., C_s$ are nested linear codes and $A$ is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the…

We investigate inference of variable-length codes in other domains of computer science, such as noisy information transmission or information retrieval-storage: in such topics, traditionally mostly constant-length codewords act. The study…

Previous work by the authors on parity-preserving fixed-length constrained encoders is extended to the variable-length case. Parity-preserving variable-length encoders are formally defined, and, to this end, Kraft conditions are developed…