activity
20142021
most citedChip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph

14 citations · 39 across the 17 of their papers we have counts for

collaborators

17 papers

math.CA2021★ 1 cited

Stability and measurability of the modified lower dimension

Richárd Balka, Márton Elekes, Viktor Kiss

The lower dimension is the dual concept of the Assouad dimension. As it fails to be monotonic, Fraser and Yu introduced the modified lower dimension by making…

math.CA2021

The range of dimensions of microsets

Richárd Balka, Márton Elekes, Viktor Kiss

We say that is a microset of the compact set if there exist sequences and such that conv…

math.GN2020

Games characterizing limsup functions and Baire class 1 functions

Márton Elekes, János Flesch, Viktor Kiss +3

We consider a real-valued function defined on the set of infinite branches of a countably branching pruned tree . The function is said to be a \textit{limsup functio…

math.CA2020

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

Richárd Balka, Márton Elekes, Viktor Kiss +1

S. Banach pointed out that the graph of the generic (in the sense of Baire category) element of has length . J. Mycielski asked if the measure theoretic du…

math.CA2020

Compact sets with large projections and nowhere dense sumset

Richárd Balka, Márton Elekes, Viktor Kiss +2

We answer a question of Banakh, Jabłońska and Jabłoński by showing that for there exists a compact set such that the projection of onto each…

math.CO2020

The devil's staircase for chip-firing on random graphs and on graphons

Viktor Kiss, Lionel Levine, Lilla Tóthmérész

We study the behavior of the activity of the parallel chip-firing upon increasing the number of chips on an Erdős--Rényi random graph. We show that in various situations the result…

math.PR2020★ 1 cited

Random continuum and Brownian motion

Viktor Kiss, Sławomir Solecki

We describe a probabilistic model involving iterated Brownian motion for constructing a random chainable continuum. We show that this random continuum is indecomposable.

math.LO2018

The structure of random automorphisms of the random graph

Udayan B. Darji, Márton Elekes, Kende Kalina +2

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 ev…

math.LO2018★ 1 cited

The structure of random automorphisms of the rational numbers

Udayan B. Darji, Márton Elekes, Kende Kalina +2

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. For the case when typical…

math.LO2017★ 1 cited

The structure of random automorphisms of countable structures

Udayan B. Darji, Márton Elekes, Kende Kalina +2

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…

math.LO2017★ 2 cited

The structure of random homeomorphisms

Udayan B. Darji, Márton Elekes, Kende Kalina +2

In order to understand the structure of the "typical" element of a homeomorphism group, one has to study how large the conjugacy classes of the group are. When typical means generi…

math.LO2017★ 5 cited

A game characterizing Baire class 1 functions

Viktor Kiss

Duparc introduced a two-player game for a function between zero-dimensional Polish spaces in which Player II has a winning strategy iff is of Baire class 1. We generalize t…

math.CO2015★ 7 cited

On the complexity of the chip-firing reachability problem

Bálint Hujter, Viktor Kiss, Lilla Tóthmérész

In this paper, we study the complexity of the chip-firing reachability problem. We show that for Eulerian digraphs, the reachability problem can be decided in strongly polynomial t…

math.LO2015★ 1 cited

Classification of bounded Baire class functions

Viktor Kiss

Kechris and Louveau showed that each real-valued bounded Baire class 1 function defined on a compact metric space can be written as an alternating sum of a decreasing countable tra…

cs.CC2014★ 14 cited

Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph

Viktor Kiss, Lilla Tóthmérész

Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing t…

math.LO2014★ 6 cited

Ranks on the Baire class functions

Márton Elekes, Viktor Kiss, Zoltán Vidnyánszky

In 1990 Kechris and Louveau developed the theory of three very natural ranks on the Baire class functions. A rank is a function assigning countable ordinals to certain objects,…

math.MG2014

Unions of regular polygons with large perimeter-to-area ratio

Viktor Kiss, Zoltán Vidnyánszky

T. Keleti asked, whether the ratio of the perimeter and the area of a finite union of unit squares is always at most 4. In this paper we present an example where the ratio is great…