Articles de revista
Recent Submissions
-
Preface
(2024-10-31)
Article
Restricted access - publisher's policy -
Griesmer type bounds for additive codes over finite fields, integral and fractional MDS codes
(2024-11-03)
Article
Open AccessIn this article we prove Griesmer type bounds for additive codes over finite fields. These new bounds give upper bounds on the length of maximum distance separable (MDS) codes, codes which attain the Singleton bound. We ... -
Stabiliser codes over fields of even order
(2024-09-04)
Article
Open AccessWe prove that the natural isomorphism F2h ~= F h 2 induces a bijection between stabilizer codes on n quqits with local dimension q = 2h and binary stabilizer codes on hn qubits. This allows us to describe these codes ... -
On the chromatic number of powers of subdivisions of graphs
(Elsevier, 2025-03-15)
Article
Open AccessFor a given graph G = (V, E), we define its nth subdivision as the graph obtained from G by replacing every edge by a path of length n. We also define the mth power of G as the graph on vertex set V where we connect every ... -
A telescopic proof of Cayley’s formula
(2024-09-24)
Article
Restricted access - publisher's policyWe give a short proof of the fact that the number of labeled trees on n vertices is n n - 2 . Although many short proofs are known, we have not seen this one before. -
Orbit problems for free-abelian times free groups and related families
(2024-11-07)
Article
Restricted access - publisher's policyWe prove that the Brinkmann Problems (BrP & BrCP) and the Twisted-Conjugacy Problem (TCP) are decidable for any endomorphism of a free-abelian times free (FATF) group F n × Z m . Furthermore, we prove the decidability of ... -
Grafs aleatoris amb una seqüència de graus donada
(Societat Catalana de Matemàtiques (SCM), 2023)
Article
Open AccessDes de l’aparició de la noció de xarxes complexes, els grafs aleatoris han resultat una eina fonamental per modelar-les i estudiar-les. En aquest article tractarem l’estudi dels grafs aleatoris amb una seqüència de graus ... -
Product-free sets in the free group
(2024-07)
Article
Open AccessWe prove that product-free subsets of the free group over a finite alphabet have maximum upper density mathematical equation with respect to the natural measure that assigns total weight one to each set of irreducible words ... -
Decidability of the Brinkmann problems for endomorphisms of the free group
(Springer, 2024-07-18)
Article
Restricted access - publisher's policyBuilding on the work of Brinkmann and Logan, we show that both the Brinkmann problem and the Brinkmann conjugacy problem are decidable for endomorphisms of the free group Fn. -
Strong Ramsey games: drawing on an infinite board
(2017-08)
Article
Open AccessConsider the following strong Ramsey game. Two players take turns in claiming a previously unclaimed edge of the complete graph on n vertices until all edges have been claimed. The first player to build a copy of K_q (q ... -
The central tree property and algorithmic problems on subgroups of free groups
(De Gruyter, 2024-02-14)
Article
Open AccessWe study the average case complexity of the Uniform Membership Problem for subgroups of free groups, and we show that it is orders of magnitude smaller than the worst case complexity of the best known algorithms. This ... -
On minimum vertex bisection of random d-regular graphs
(2024-09)
Article
Open AccessMinimum vertex bisection is a graph partitioning problem in which the aim is to find a partition of the vertices into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the ...
RSS 1.0