arXiv subjects

Katalin Berlow

Publications and source records attributed to Katalin Berlow.

6 recordsLinked to original sources

arXiv2025

Borel Polychromatic Number of Grids

We study Borel polychromatic colorings of grid graphs arising from free Borel actions of $\mathbb{Z}^d$. A polychromatic coloring is one in which every unit $d$-dimensional cube sees all available colors. In the classical setting, every grid admits a $2^d$-polychromatic coloring, while in the Borel setting this fails. Our main result shows that every free $\mathbb{Z}^d$-action admits a Borel $(2^d-1)$-polychromatic coloring. This result is sharp: any action where the generators act ergodically does not admit a Borel $2^d$-polychromatic coloring. We conclude with open directions for extending the theory beyond cube tilings and for exploring the dependence of Borel polychromatic numbers on the underlying action.

math.LO↗

arXiv2025

Separating complexity classes of LCL problems on grids

We study the complexity of locally checkable labeling (LCL) problems on $\mathbb{Z}^n$ from the point of view of descriptive set theory, computability theory, and factors of i.i.d. Our results separate various complexity classes that were not previously known to be distinct and serve as counterexamples to a number of natural conjectures in the field.

math.LO↗

arXiv2023

Almost Abelian Lie groups, subgroups and quotients

An almost Abelian Lie group is a non-Abelian Lie group with a codimension 1 Abelian normal subgroup. The majority of 3-dimensional real Lie groups are almost Abelian, and they appear in all parts of physics that deal with anisotropic media - cosmology, crystallography etc. In theoretical physics and differential geometry, almost Abelian Lie groups and their homogeneous spaces provide some of the simplest solvmanifolds on which a variety of geometric structures such as symplectic, Kähler, spin etc., are currently studied in explicit terms. Recently, almost Abelian Lie algebras were classified and studied in details. However, a systematic investigation of almost Abelian Lie groups has not been carried out yet, and the present paper is devoted to an explicit description of properties of this wide and diverse class of groups. The subject of investigation are real almost Abelian Lie groups with their Lie group theoretical aspects, such as the exponential map, faithful matrix representations, discrete and connected subgroups, quotients and automorphisms. The emphasis is put on explicit description of all technical details.

math.GR↗

arXiv2022

Intersection Bodies of Polytopes

We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for its computation. Moreover, we compute the irreducible components of the algebraic boundary and provide an upper bound for the degree of these components.

math.AG↗

arXiv2021

Restricted Stacks as Functions

The stack sort algorithm has been the subject of extensive study over the years. In this paper we explore a generalized version of this algorithm where instead of avoiding a single decrease, the stack avoids a set $T$ of permutations. We let $s_T$ denote this map. We classify for which sets $T$ the map $s_T$ is bijective. A corollary to this answers a question of Baril, Cerbai, Khalil, and Vajnovszki about stack sort composed with $s_{\{σ,τ\}}$, known as the $(σ,τ)$-machine. This fully classifies for which $σ$ and $τ$ the preimage of the identity under the $(σ,τ)$-machine is counted by the Catalan numbers. We also prove that the number of preimages of a permutation under the map $s_T$ is bounded by the Catalan numbers, with a shift of indices. For $T$ of size 1, we classify exactly when this bound is sharp. We also explore the periodic points and maximum number of preimages of various $s_T$ for $T$ containing two length $3$ permutations.

math.CO↗

arXiv2020

Distance Sequences of Locally Infinite Primitive Graphs

A graph is called primitive if its automorphism group acts primitively on the vertex set. In this paper, we prove a classification of the possible distance sequences of locally infinite primitive graphs. In particular we show that if a primitive graph is locally uncountable, the distance sequence is constant until it terminates. We also prove a constraint on the distance sequences of locally finite infinite graphs.

math.CO↗