Searcharxiv⌕ Search

arXiv subjects

Márton Elekes

Publications and source records attributed to Márton Elekes.

At least 19 recordsLinked to original sources

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↗

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↗

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↗

To Do or Not to Do: Semantics and Patterns for Do Activities in UML PSSM State Machines

State machines are used in engineering many types of software-intensive systems. UML State Machines extend simple finite state machines with powerful constructs. Among the many extensions, there is one seemingly simple and innocent language construct that fundamentally changes state machines' reactive model of computation: doActivity behaviors. DoActivity behaviors describe behavior that is executed independently from the state machine once entered in a given state, typically modeling complex computation or communication as background tasks. However, the UML specification or textbooks are vague about how the doActivity behavior construct should be appropriately used. This lack of guidance is a severe issue as, when improperly used, doActivities can cause concurrent, non-deterministic bugs that are especially challenging to find and could ruin a seemingly correct software design. The Precise Semantics of UML State Machines (PSSM) specification introduced detailed operational semantics for state machines. To the best of our knowledge, there is no rigorous review yet of doActivity's semantics as specified in PSSM. We analyzed the semantics by collecting evidence from cross-checking the text of the specification, its semantic model and executable test cases, and the simulators supporting PSSM. We synthesized insights about subtle details and emergent behaviors relevant to tool developers and advanced modelers. We reported inconsistencies and missing clarifications in more than 20 issues to the standardization committee. Based on these insights, we studied 11 patterns for doActivities detailing the consequences of using a doActivity in a given situation and discussing countermeasures or alternative design choices. We hope that our analysis of the semantics and the patterns help vendors develop conformant simulators or verification tools and engineers design better state machine models.

cs.SE↗

Compact sets with large projections and nowhere dense sumset

We answer a question of Banakh, Jabłońska and Jabłoński by showing that for $d\ge 2$ there exists a compact set $K \subseteq \mathbb{R}^d$ such that the projection of $K$ onto each hyperplane is of non-empty interior, but $K+K$ is nowhere dense. The proof relies on a random construction. A natural approach in the proofs is to construct such a $K$ in the unit cube with full projections, that is, such that the projections of $K$ agree with that of the unit cube. We investigate the generalization of these problems for projections onto various dimensional subspaces as well as for $\ell$-fold sumsets. We obtain numerous positive and negative results, but also leave open many interesting cases. We also show that in most cases if we have a specific example of such a compact set then actually the generic (in the sense of Baire category) compact set in a suitably chosen space is also an example. Finally, utilizing a computer-aided construction, we show that the compact set in the plane with full projections and nowhere dense sumset can be self-similar.

math.CA↗

An analysis of the SIGMOD 2014 Programming Contest: Complex queries on the LDBC social network graph

This report contains an analysis of the queries defined in the SIGMOD 2014 Programming Contest. We first describe the data set, then present the queries, providing graphical illustrations for them and pointing out their caveats. Our intention is to document our lessons learnt and simplify the work of those who will attempt to create a solution to this contest. We also demonstrate the influence of this contest by listing followup works which used these queries as inspiration to design better algorithms or to define interesting graph queries.

cs.DB↗

Generic countably infinite groups

Countably infinite groups (with a fixed underlying set) constitute a Polish space $G$ with a suitable metric, hence the Baire category theorem holds in $G$. We study isomorphism invariant subsets of $G$, which we call group properties. We say that the generic countably infinite group is of property $P$ if $P$ is comeager in $G$. We prove that every group property with the Baire property is either meager or comeager. We show that there is a comeager elementary equivalence class in $G$ but every isomorphism class is meager. We prove that the generic group is algebraically closed, simple, not finitely generated and not locally finite. We show that in the subspace of Abelian groups the generic group is isomorphic to the unique countable, divisible torsion group that contains every finite Abelian group. We sketch the model-theoretic setting in which many of our results can be generalized. We briefly discuss a connection with infinite games.

math.LO↗

The range of dimensions of microsets

We say that $E$ is a microset of the compact set $K\subset \mathbb{R}^d$ if there exist sequences $λ_n\geq 1$ and $u_n\in \mathbb{R}^d$ such that $(λ_n K + u_n ) \cap [0,1]^d$ converges to $E$ in the Hausdorff metric, and moreover, $E \cap (0, 1)^d \neq \emptyset$. The main result of the paper is that for a non-empty set $A\subset [0,d]$ there is a compact set $K\subset \mathbb{R}^d$ such that the set of Hausdorff dimensions attained by the microsets of $K$ equals $A$ if and only if $A$ is analytic and contains its infimum and supremum. This answers a question of Fraser, Howroyd, Käenmäki, and Yu. We show that for every compact set $K\subset \mathbb{R}^d$ and non-empty analytic set $A\subset [0,\dim_H K]$ there is a set $\mathcal{C}$ of compact subsets of $K$ which is compact in the Hausdorff metric and $\{\dim_H C: C\in \mathcal{C} \}=A$. The proof relies on the technique of stochastic co-dimension applied for a suitable coupling of fractal percolations with generation dependent retention probabilities. We also examine the analogous problems for packing and box dimensions.

math.CA↗

Singularity of maps of several variables and a problem of Mycielski concerning prevalent homeomorphisms

S. Banach pointed out that the graph of the generic (in the sense of Baire category) element of $\text{Homeo}([0,1])$ has length $2$. J. Mycielski asked if the measure theoretic dual holds, i.e., if the graph of all but Haar null many (in the sense of Christensen) elements of $\text{Homeo}([0,1])$ have length $2$. We answer this question in the affirmative. We call $f \in \text{Homeo}([0,1]^d)$ singular if it takes a suitable set of full measure to a nullset, and strongly singular if it is almost everywhere differentiable with singular derivative matrix. Since the graph of $f \in \text{Homeo}([0,1])$ has length $2$ iff $f$ is singular iff $f$ is strongly singular, the following results are the higher dimensional analogues of Banach's observation and our solution to Mycielski's problem. We show that for $d \ge 2$ the graph of the generic element of $\text{Homeo}([0,1]^d)$ has infinite $d$-dimensional Hausdorff measure, contrasting the above result of Banach. The measure theoretic dual remains open, but we show that the set of elements of $\text{Homeo}([0,1]^d)$ with infinite $d$-dimensional Hausdorff measure is not Haar null. We show that for $d \ge 2$ the generic element of $\text{Homeo}([0,1]^d)$ is singular but not strongly singular. We also show that for $d \ge 2$ almost every element of $\text{Homeo}([0,1]^d)$ is singular, but the set of strongly singular elements form a so called Haar ambivalent set (neither Haar null, nor co-Haar null). Finally, in order to clarify the situation, we investigate the various possible definitions of singularity for maps of several variables, and explore the connections between them.

math.CA↗

Stability and measurability of the modified lower dimension

The lower dimension $\dim_L$ is the dual concept of the Assouad dimension. As it fails to be monotonic, Fraser and Yu introduced the modified lower dimension $\dim_{ML}$ by making the lower dimension monotonic with the simple formula $\dim_{ML} X=\sup\{\dim_L E: E\subset X\}$. As our first result we prove that the modified lower dimension is finitely stable in any metric space, answering a question of Fraser and Yu. We prove a new, simple characterization for the modified lower dimension. For a metric space $X$ let $\mathcal{K}(X)$ denote the metric space of the non-empty compact subsets of $X$ endowed with the Hausdorff metric. As an application of our characterization, we show that the map $\dim_{ML} \colon \mathcal{K}(X)\to [0,\infty]$ is Borel measurable. More precisely, it is of Baire class $2$, but in general not of Baire class $1$. This answers another question of Fraser and Yu. Finally, we prove that the modified lower dimension is not Borel measurable defined on the closed sets of $\ell^1$ endowed with the Effros Borel structure.

math.CA↗

Cardinal invariants of Haar null and Haar meager sets

A subset $X$ of a Polish group $G$ is \emph{Haar null} if there exists a Borel probability measure $μ$ and a Borel set $B$ containing $X$ such that $μ(gBh)=0$ for every $g,h \in G$. A set $X$ is \emph{Haar meager} if there exists a compact metric space $K$, a continuous function $f : K \to G$ and a Borel set $B$ containing $X$ such that $f^{-1}(gBh)$ is meager in $K$ for every $g,h \in G$. We calculate (in $ZFC$) the four cardinal invariants ($\rm add$, $\rm cov$, $\rm non$, $\rm cof$) of these two $σ$-ideals for the simplest non-locally compact Polish group, namely in the case $G = \mathbb{Z}^ω$. In fact, most results work for separable Banach spaces as well, and many results work for Polish groups admitting a two-sided invariant metric. This answers a question of the first named author and Z. Vidnyánszky.

math.LO↗

Games characterizing limsup functions and Baire class 1 functions

We consider a real-valued function $f$ defined on the set of infinite branches $X$ of a countably branching pruned tree $T$. The function $f$ is said to be a \textit{limsup function} if there is a function $u \colon T \to \mathbb{R}$ such that $f(x) = \limsup_{t \to \infty} u(x_{0},\dots,x_{t})$ for each $x \in X$. We study a game characterization of limsup functions, as well as a novel game characterization of functions of Baire class 1.

math.GN↗

Haar-positive closed subsets of Haar-positive analytic sets

We show that every non-Haar-null analytic subset of $\mathbb{Z}^ω$ contains a non-Haar-null closed subset. Moreover, we also prove that the codes of Haar-null analytic subsets, and, consequently, closed Haar-null sets in the Effros Borel space of $\mathbb{Z}^ω$ form a $\mathbfΔ^1_2$ set.

math.LO↗

A Haar meager set that is not strongly Haar meager

Following Darji, we say that a Borel subset $B$ of an abelian Polish group $G$ is Haar meager if there is a compact metric space $K$ and a continuous function $f : K \to G$ such that the preimage of the translate, $f^{-1}(B+g)$ is meager in $K$ for every $g \in G$. The set $B$ is called strongly Haar meager if there is a compact set $C \subseteq G$ such that $(B+g) \cap C$ is meager in $C$ for every $g \in G$. The main open problem in this area is Darji's question asking whether these two notions are the same. Even though there have been several partial results suggesting a positive answer, in this paper we construct a counterexample. More specifically, we construct a $G_δ$ set in $\mathbb{Z}^ω$ that is Haar meager but not strongly Haar meager. We also show that no $F_σ$ counterexample exists, hence our result is optimal.

math.LO↗

The structure of random automorphisms of countable structures

In order to understand the structure of the `typical' element of an automorphism group, one has to study how large the conjugacy classes of the group are. When typical is meant in the sense of Baire category, a complete description of the size of the conjugacy classes has been given by Kechris and Rosendal. Following Dougherty and Mycielski we investigate the measure theoretic dual of this problem, using Christensen's notion of Haar null sets. When typical means random, that is, almost every with respect to this notion of Haar null sets, the behavior of the automorphisms is entirely different from the Baire category case. In this paper, we generalize the theorems of Dougherty and Mycielski about $S_\infty$ to arbitrary automorphism groups of countable structures isolating a new model theoretic property, the Cofinal Strong Amalgamation Property. As an application we show that a large class of automorphism groups can be decomposed into the union of a meager and a Haar null set.

math.LO↗

Set-theoretical problems concerning Hausdorff measures

J. Zapletal asked if all the forcing notions considered in his monograph are homogeneous. Specifically, he asked if the forcing consisting of Borel sets of $σ$-finite 2-dimensional Hausdorff measure in $\mathbb{R}^3$ (ordered under inclusion) is homogeneous. We give a partial negative answer to both questions by showing that this $σ$-ideal is not homogeneous. Let $\mathcal{N}^1_2$ be the $σ$-ideal of sets in the plane of 1-dimensional Hausdorff measure zero. D. H. Fremlin determined the position of the cardinal invariants of this $σ$-ideal in the Cichoń Diagram. This required proving numerous inequalities, and in all but three cases it was known that the inequalities can be strict in certain models. For one of the remaining ones Fremlin posed this as an open question in his monograph. We answer this by showing that consistently $\mathrm{cov}(\mathcal{N}^1_2) > \mathrm{cov}(\mathcal{N})$, where $\mathcal{N}$ is the usual Lebesgue null ideal. We also prove that the remaining two inequalities can be strict. Moreover, we fit the cardinal invariants of the $σ$-ideal of sets of $σ$-finite Hausdorff measure into the diagram. P. Humke and M. Laczkovich raised the following question. Is it consistent that there is an ordering of the reals in which all proper initial segments are Lebesgue null but for every ordering of the reals there is a proper initial segment that is not null with respect to the $1/2$-dimensional Hausdorff measure? We determine the values of the cardinal invariants of the Cichoń Diagram as well as the invariants of the nullsets of Hausdorff measures in the first model mentioned in the previous paragraph, and as an application we answer this question of Humke and Laczkovich affirmatively.

math.LO↗

Haar null and Haar meager sets: a survey and new results

We survey results about Haar null subsets of (not necessarily locally compact) Polish groups. The aim of this paper is to collect the fundamental properties of the various possible definitions of Haar null sets, and also to review the techniques that may enable the reader to prove results in this area. We also present several recently introduced ideas, including the notion of Haar meager sets, which are closely analogous to Haar null sets. We prove some results in a more general setting than that of the papers where they were originally proved and prove some results for Haar meager sets which were already known for Haar null sets.

math.LO↗

The structure of random automorphisms of the random graph

We give a complete description of the size of the conjugacy classes of the automorphism group of the random graph with respect to Christensen's Haar null ideal. It is shown that every non-Haar null class contains a translated copy of a nonempty portion of every compact set and that there are continuum many non-Haar null conjugacy classes. Our methods also yield a new proof of an old result of Truss.

math.LO↗