Related papers: On the factor set of code loops
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…
Large Language Models (LLMs) typically excel at coding tasks involving high-level programming languages, as opposed to lower-level programming languages, such as assembly. We propose a synthetic data generation method named C-ing Clearly,…
In this work we present work in progress on functionality duplication detection in logic programs. Eliminating duplicated functionality recently became prominent in context of refactoring. We describe a quantitative approach that allows to…
Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…
Let $M$ be a non-zero binary matrix with distinct rows where the rows are closed under certain logical operators. In this article, we investigate the existence of columns containing an equal or greater number of ones than zeros.…
Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required…
Isotopes of C-loops with unique non-identity squares are shown to be both C-loops and A-loops. The relationship between C-loops and Steiner loops is further studied. Central loops with the weak and cross inverse properties are also…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.
A correlation is a binary vector that encodes all possible positions of overlaps of two words, where an overlap for an ordered pair of words (u,v) occurs if a suffix of word u matches a prefix of word v. As multiple pairs can have the same…
The aim of this work is to study the dual and the algebraic dual of an evaluation code using standard monomials and indicator functions. We show that the dual of an evaluation code is the evaluation code of the algebraic dual. We develop an…
In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. Strong equivalence of two programs can be sometimes established by deriving rules of each program from rules of…
We find that scattering amplitudes in massive scalar QCD can manifest the duality between color and kinematics at loop-level. Specifically we construct the one-loop integrands for four-point scattering between two distinct massive scalars,…
The main aim of this paper is to study $LCD$ codes. Linear code with complementary dual($LCD$) are those codes which have their intersection with their dual code as $\{0\}$. In this paper we will give rather alternative proof of Massey's…
A binarization of a bounded variable $x$ is a linear formulation with variables $x$ and additional binary variables $y_1,\dots, y_k$, so that integrality of $x$ is implied by the integrality of $y_1,\dots, y_k$. A binary extended…
For rings R with identity, we define a class of nonlinear higher order recurrences on unitary left R-modules that include linear recurrences as special cases. We obtain conditions under which a recurrence of order k+1 in this class is…
We define a variable-length code having the property that no (non-empty) prefix of each its codeword is a suffix of any other one, and vice versa. This kind of code can be seen as an extension of two well-known codes in literature, called…
We encode arrays as functions which, in turn, are encoded as sets of ordered pairs. The set cardinality of each of these functions coincides with the length of the array it is representing. Then we define a fragment of set theory that is…
Linear codes and $t$-designs are interactive with each other. It is well known that some $t$-designs have been constructed by using certain linear codes in recent years. However, only a small number of infinite families of the extended…
Additive codes have attracted considerable attention for their potential to outperform linear codes. However, distinguishing strictly additive codes from those that are equivalent to linear codes remains a fundamental challenge. To resolve…