Related papers: MacWilliams Identities for Codes on Graphs
Recently, Brouwer, Cioab\u{a}, Ihringer and McGinnis obtained some new results involving the eigenvalues of various graphs coming from association schemes and posed some conjectures related to the eigenvalues of Grassmann graphs, bilinear…
Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…
To date, the best circle graph recognition algorithm runs in almost linear time as it relies on a split decomposition algorithm that uses the union-find data-structure. We show that in the case of circle graphs, the PC-tree data-structure…
While stabilizer tableaus have proven useful as a descriptive tool for additive quantum codes, they otherwise offer little guidance for concrete constructions or algorithm analysis. We introduce a representation of stabilizer codes as…
An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…
This paper presents a new graph isomorphism invariant, called $\mathfrak{w}$-labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism problem for various graph classes. For example, all…
The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kazi{\'o}w in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two adjacent vertices get incident to the same product of…
We prove two multivariate $q$-binomial identities conjectured by Bousseau, Brini and van Garrel [Geom. Topol. 28 (2024), 393-496, arXiv:2011.08830] which give generating series for Gromov-Witten invariants of two specific log Calabi-Yau…
Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and…
This is an extended write-up of a talk given in April, 1993 in honor of Raoul Bott's 70th birthday. We first illustrate how some traditional topological and geometric invariants obey ``gluing laws'' inspired by those in classical and…
In 2019, investigation of the so-called factor-invariant cubic graphs was initiated by Alspach, Khodadadpour and Kreher. For a cubic graph $\Gamma$ and a vertex-transitive subgroup $G$ of $\mathrm{Aut}(\Gamma)$, a $2$-factor $\mathcal{C}$…
The number-theoretic codes are a class of codes defined by single or multiple congruences. These codes are mainly used for correcting insertion and deletion errors, and for correcting asymmetric errors. This paper presents a formula for a…
Bachmann proves an identity expressing the generating series of MacMahon's generalized sum-of-divisors $q$-series in terms of Eisenstein series. MacMahon's $q$-series can be regarded as a $q$-analogue of the multiple zeta value $\zeta(2, 2,…
Cameron-Liebler sets of subspaces in projective spaces were studied recently by Blokhuis, De Boeck and D'haeseleer (Des. Codes Cryptogr., 2019). In this paper, we discuss Cameron-Liebler sets in bilinear forms graphs, obtain several…
We present a general framework for constructing error-correcting codes using distributed graph coloring under the LOCAL model. Building on the correspondence between independent sets in the confusion graph and valid codes, we show that the…
A new construction of codes from old ones is considered, it is an extension of the matrix-product construction. Several linear codes that improve the parameters of the known ones are presented.
Identifying codes have been introduced in 1998 to model fault-detection in multiprocessor systems. In this paper, we introduce two variations of identifying codes: weak codes and light codes. They correspond to fault-detection by successive…
Obtaining consistent explanations for machine learning on molecular graphs requires predictions and attributions to be aligned with chemical identity. However, chemically equivalent drawings of the same molecule can induce different…
We establish the invariant trace formula (\`a la Arthur) for the ad\'elic covers of connected reductive groups over a number field, under the hypothesis that the trace Paley-Wiener theorem is verified for all Levi subgroups at the real…
We define a graded graph, called the Schur--Weyl graph, which arises naturally when one considers simultaneously the RSK algorithm and the classical duality between representations of the symmetric and general linear groups. As one of the…