| Title: | Finding a perfect matching of F_2^n with prescribed differences |
|---|
| Authors: | ID Kovács, Benedek (Author) |
| Files: | AMC_Kovacs_2026.pdf (467,06 KB) MD5: 8FFDD2BEE697ABEAA3D3E4A466F79281
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | We consider the following question by Balister, Győri and Schelp: given 2^{n-1} nonzero vectors in F_2^n with zero sum, is it always possible to partition the elements of F_2^n into pairs such that the difference between the two elements of the i-th pair is equal to the i-th given vector for every i? An analogous question in F_p, which is a case of the so-called "seating couples" problem, has been resolved by Preissmann and Mischler in 2009. In this paper, we prove the conjecture in F_2^n in the case when the number of distinct values among the given difference vectors is at most n-2log(n)-1, and also in the case when at least a fraction 1/2+ε of the given vectors are equal (for all ε>0 and n sufficiently large based on ε). |
|---|
| Keywords: | binary vector spaces, seating couples, prescribed differences, perfect matching, functional batch code, graph colourings |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 20.11.2025 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | 22 str. |
|---|
| Numbering: | Vol. 26, no. 1, [article no.] P1.05 |
|---|
| PID: | 20.500.12556/RUP-22289  |
|---|
| UDC: | 51 |
|---|
| eISSN: | 1855-3974 |
|---|
| DOI: | 10.26493/1855-3974.3265.91b  |
|---|
| Publication date in RUP: | 21.12.2025 |
|---|
| Views: | 207 |
|---|
| Downloads: | 0 |
|---|
| Metadata: |  |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |