arXiv subjects

Anett Kocsis

Publications and source records attributed to Anett Kocsis.

7 recordsLinked to original sources

arXiv2025

Elusive properties of countably infinite graphs

A graph property is elusive (or evasive) if any algorithm testing it by asking questions of the form ''Is there an edge between vertices x and y?'' must, in the worst case, examine all pairs of vertices. Elusiveness for infinite vertex sets has been first studied by Csernák and Soukup, who proved that the long-standing Aanderaa-Karp-Rosenberg Conjecture -- which states that every nontrivial monotone graph property is elusive -- fails for infinite vertex sets. We extend their work by giving a closer look to the case when the vertex set is countably infinite and the ''algorithm'' terminates after infinitely many steps. Among others, we prove that connectedness is elusive, which strengthens a result of Csernák and Soukup. We give counterexamples to the infinite version of the Aanderaa-Karp-Rosenberg Conjecture even if the ''algorithm'' is required to terminate after infinitely many steps, which strengthens results of Csernák and Soukup.

math.CO↗

arXiv2025

Generic properties of topological groups

We study generic properties of topological groups in the sense of Baire category. First we investigate countably infinite (discrete) groups. We extend a classical result of B. H. Neumann, H. Simmons and A. Macintyre on algebraically closed groups and the word problem. I. Goldbring, S. E. Kunnawalkam and Y. Lodha proved that every isomorphism class is meager among countably infinite (discrete) groups. In contrast, we show that there is a comeager isomorphism class among countably infinite (discrete) abelian groups. Then we turn to compact metrizable abelian groups. We use Pontryagin duality to show that there is a comeager isomorphism class among compact metrizable abelian groups. We discuss its connections to the countably infinite (discrete) case. Finally, we study compact metrizable groups. We prove that the generic compact metrizable group is neither connected nor totally disconnected; also it is neither torsion-free nor a torsion group.

math.LO↗

arXiv2025

Generic isomorphism classes of abelian groups

We prove that the universal solenoid is the generic (in the sense of Baire category) connected compact metrizable abelian group. We also settle the dual problem in the sense of Pontryagin duality: $(\mathbb{Q},+)$, which is the dual of the universal solenoid, is the generic countably infinite torsion-free abelian group.

math.LO↗

arXiv2023

Multiplicative complements II

In this paper we prove that if $A$ and $B$ are infinite subsets of positive integers such that every positive integer $n$ can be written as $n=ab$, $a\in A$, $b\in B$, then $\displaystyle \lim_{x\to \infty}\frac{A(x)B(x)}{x}=\infty $. We also prove many other results about sets like this.

math.NT↗

arXiv2022

Compact Lie groups isolated up to conjugacy

The set $\mathcal S(G)$ of compact subgroups of a Hausdorff topological group $G$ can be equipped with the Vietoris topology. A compact subgroup $K\in\mathcal S(G)$ is isolated up to conjugacy if there is a neighborhood $\mathcal U\subseteq\mathcal S(G)$ of $K$ such that every $L\in\mathcal U$ is conjugate to $K$. In this paper, we characterize compact subgroups of a Lie group that are isolated up to conjugacy. Our characterization depends only on the intrinsic structure of $K$, the ambient Lie group $G$ and the embedding of $K$ into $G$ are irrelevant. In addition, we prove that any continuous homomorphism from a compact group $G$ onto a compact Lie group $H$ induces a continuous open map from $\mathcal S(G)$ onto $\mathcal S(H)$.

math.DG↗

arXiv2022

Multiplicative complements I

In this paper, we study how dense a multiplicative basis of order $h$ for $\mathbb{Z}^+\!$ can be, improving on earlier results. Upon introducing the notion of a \textit{multiplicative complement}, we present some tight density bounds.

math.NT↗

arXiv2021

Clique number of Xor products of Kneser graphs

In this article we investigate a problem in graph theory, which has an equivalent reformulation in extremal set theory similar to the problems researched in "A general 2-part Erdős-Ko-Rado theorem" by Gyula O.H. Katona, who proposed our problem as well. In the graph theoretic form we examine the clique number of the Xor product of two isomorphic $KG(N,k)$ Kneser graphs. Denote this number with $f(k,N)$. We give lower and upper bounds on $f(k,N)$, and we solve the problem up to a constant deviation depending only on $k$, and find the exact value for $f(2,N)$ if $N$ is large enough. We also compute that $f(k,k^2)$ is asymptotically equivalent to $k^2$.

math.CO↗