Bibliographic record
Abstract
Let ν(Z) be the minimal number of colors enough to color the m-dimensional integer grid Z so that there would be no infinite monochromatic symmetric subsets. Banakh and Protasov [3] compute ν(Z) = m + 1. For the one-dimensional case this just means that one can color positive integers in red, while negative in blue, thereby avoiding an infinite monochromatic symmetric subset by trivial reason. This motivates the question what changes if we allow only colorings unlimited in both directions (in “all” directions for m > 1). In this paper we show that then ν(Z) increases in 1, whereas for higher dimensions the values ν(Z) remain unaffected. Furthermore we examine the density properties of a set A ⊆ Z that ensure the existence of infinite symmetric subsets or arbitrarily large finite symmetric subsets in A. In the case that A is a sequence with small gaps, we prove a multi-dimensional analogue of the Szemeredi theorem, with symmetric subsets in place of arithmetic progressions. A similar two-dimensional statement is known for collinear subsets (Pomerance [10]), whereas for two-dimensional arithmetic progressions even the corresponding version of van der Waerden’s theorem is known to be false. We also observe that A ⊆ N contains arbitrarily large symmetric subsets whenever the series ∑ a∈A 1/a diverges (for arithmetic progressions this is the well-known unproven conjecture of Erdős). A natural two-dimensional analogue of the latter statement is false. We show a counterexample built upon Erdős’s construction of a dense infinite B2-sequence. ∗Department of Mechanics & Mathematics, Lviv University, Universytetska 1, 290602 Lviv, Ukraine. E-mail: tbanakh@franko.lviv.ua. Research supported in part by grant INTAS-96-0753. †Department of Numerical Mathematics & Programming, State University “Lvivska Polytechnika”, Bandera St. 12, 290646 Lviv, Ukraine. Part of this work was done while visiting the Institute of Mathematics, University of Vienna, supported by an OAD grant. ‡Part of this work was done while visiting the Institute of Information Systems, Vienna University of Technology, supported by a Lise Meitner Fellowship of the Austrian Science Foundation (FWF). Current e-mail: oleg@dbai.tuwien.ac.at.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".