HUN-REN Alfréd Rényi Institute of Mathematics

output

19942026

most citedBrownian distance covariance

857 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2019Show all

37 papers · 1 filter

math.NT2019★ 4 cited

On the discrepancy of random subsequences of ${n α}$

Istvan Berkes, Bence Borda

For irrational $α$ , ${n α}$ is uniformly distributed mod 1 in the Weyl sense, and the asymptotic behavior of its discrepancy is completely known. In contrast, very few precise res…

math.CO2019★ 2 cited

Sticky matroids and convolution

Laszlo Csirmaz

Motivated by the characterization of the lattice of cyclic flats of a matroid, the convolution of a ranked lattice and a discrete measure is defined, generalizing polymatroid convo…

math.CO2019

Remarks on the distribution of colors in Gallai colorings

Joseph Feffer, Yaoying Fu, Jun Yan

A Gallai coloring of a complete graph $K_{n}$ is an edge coloring without triangles colored with three different colors. A sequence $e_{1} \geq \dots \geq e_{k}$ of positive integers is an…

math.CO2019★ 1 cited

The domination number of the graph defined by two levels of the $n$ -cube, II

József Balogh, Gyula O. H. Katona, William Linz +1

Consider all $k$ -element subsets and $ℓ$ -element subsets $(k > ℓ)$ of an $n$ -element set as vertices of a bipartite graph. Two vertices are adjacent if the corresponding $\ell…

math.GR2019★ 6 cited

On the generalized Fitting height and insoluble length of finite groups

Robert M. Guralnick, Gareth Tracey

We prove two conjectures of E. Khukhro and P. Shumyatsky concerning the Fitting height and insoluble length of finite groups. As a by-product of our methods, we also prove a genera…

math.MG2019

On polyhedra inscribed in $S^{2}$ , with approximately equal edges

E. Makai

We consider triangle faced convex polyhedra inscribed in the unit sphere $S^{2}$ in $R^{3}$ . One way of measuring their deviation from regular polyhedra with triangular faces i…

math.FA2019★ 5 cited

Approximation of the average of some random matrices

Grigory Ivanov, Márton Naszódi, Alexandr Polyanskii

Rudelson's theorem states that if for a set of unit vectors $u_{i}$ and positive weights $c_{i}$ , we have that $\sum c_{i} u_{i} \otimes u_{i}$ is the identity operator $I$ on $R^{d}$ …

math.PR2019★ 3 cited

Split-and-Merge in Stationary Random Stirring on Lattice Torus

Dmitry Ioffe, Bálint Tóth

We show that in any dimension $d \geq 1$ , the cycle-length process of stationary random stirring (or, random interchange) on the lattice torus converges to the canonical Markovian spl…

math.CO2019★ 3 cited

Half-graphs, other non-stable degree sequences, and the switch Markov chain

Péter L. Erdős, Ervin Győri, Tamás Róbert Mezei +2

One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using switches. The switch Markov chain con…

cs.CR2019★ 1 cited

Complexity of universal access structures

Laszlo Csirmaz

An important parameter in a secret sharing scheme is the number of minimal qualified sets. Given this number, the universal access structure is the richest possible structure, name…

math.CO2019

On $L$ -close Sperner systems

Daniel Nagy, Balazs Patkos

For a set $L$ of positive integers, a set system $F \subseteq 2^{[n]}$ is said to be $L$ -close Sperner, if for any pair $F, G$ of distinct sets in $F$ the skew d…

math.CO2019★ 2 cited

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs

Joshua Erde, Pascal Gollin, Atilla Joó +2

We show that if a graph admits a packing and a covering both consisting of $λ$ many spanning trees, where $λ$ is some infinite cardinal, then the graph also admits a decomposition…

math.DS2019★ 5 cited

Lee-Yang Zeros of the antiferromagnetic Ising Model

Ferenc Bencs, Pjotr Buys, Lorenzo Guerini +1

We investigate the location of zeros for the partition function of the anti-ferromagnetic Ising Model, focusing on the zeros lying on the unit circle. We give a precise characteriz…

cs.CC2019

Between the deterministic and non-deterministic query complexity

Dániel Gerbner

We consider problems that can be solved by asking certain queries. The deterministic query complexity $D (P, n)$ of a problem $P$ is the smallest number of queries needed to ask in o…

math.MG2019★ 4 cited

On the best constants associated with $n$ -distances

Gergely Kiss, Jean-Luc Marichal

We pursue the investigation of the concept of $n$ -distance, an $n$ -variable version of the classical concept of distance recently introduced and investigated by Kiss, Marichal, and…

math.NT2019

Counting bounded elements of a number field

Mikołaj Frączyk, Gergely Harcos, Péter Maga

We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obta…

math.CO2019★ 8 cited

Edge-ordered Ramsey numbers

Martin Balko, Máté Vizer

We introduce and study a variant of Ramsey numbers for edge-ordered graphs, that is, graphs with linearly ordered sets of edges. The edge-ordered Ramsey number $\overline{R}_e(\mat…

math.GR2019★ 7 cited

$F$ -inverse monoids as algebraic structures in enriched signature

K. Auinger, G. Kudryavtseva, M. B. Szendrei

Every $F$ -inverse monoid can be equipped with the unary operation which maps each element to the maximum element of its $σ$ -class. In this enriched signature, the class of all $F$ -…

math.CO2019★ 1 cited

Inequalities for doubly nonnegative functions

Alexander Sidorenko

Let $g$ be a bounded symmetric measurable nonnegative function on $[0, 1]^{2}$ , and $∥ g ∥ = \int_{[0, 1]^{2}} g (x, y) d x d y$ . For a graph $G$ with vertices $\{v_1,v_…

math.CA2019★ 96 cited

The Fuglede conjecture for convex domains is true in all dimensions

Nir Lev, Máté Matolcsi

A set $Ω \subset R^{d}$ is said to be spectral if the space $L^{2} (Ω)$ has an orthogonal basis of exponential functions. A conjecture due to Fuglede (1974) stated that $Ω$ is a…

econ.GN2019★ 8 cited

Risk-neutral pricing for APT

Laurence Carassus, Miklos Rasonyi

We consider infinite dimensional optimization problems motivated by the financial model called Arbitrage Pricing Theory. Using probabilistic and functional analytic tools, we provi…

math.MG2019★ 5 cited

Polarization, sign sequences and isotropic vector systems

Gergely Ambrus, Sloan Nietert

We determine the order of magnitude of the $n$ th $ℓ_{p}$ -polarization constant of the unit sphere $S^{d - 1}$ for every $n, d \geq 1$ and $p > 0$ . For $p = 2$ , we prove that extremizers…

math.CO2019★ 2 cited

New bounds on even cycle creating Hamiltonian paths using expander graphs

Gergely Harcos, Daniel Soltész

We say that two graphs on the same vertex set are $G$ -creating if their union (the union of their edges) contains $G$ as a subgraph. Let $H_{n} (G)$ be the maximum number of pairwise…

math.CO2019★ 19 cited

The mixing time of the switch Markov chains: a unified approach

Péter L. Erdős, Catherine Greenhill, Tamás Róbert Mezei +3

Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results w…

On the discrepancy of random subsequences of {nα}

Sticky matroids and convolution

Remarks on the distribution of colors in Gallai colorings

The domination number of the graph defined by two levels of the n-cube, II

On the generalized Fitting height and insoluble length of finite groups

On polyhedra inscribed in S2, with approximately equal edges

Approximation of the average of some random matrices

Split-and-Merge in Stationary Random Stirring on Lattice Torus

Half-graphs, other non-stable degree sequences, and the switch Markov chain

Complexity of universal access structures

On L-close Sperner systems

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs

Lee-Yang Zeros of the antiferromagnetic Ising Model

Between the deterministic and non-deterministic query complexity

On the best constants associated with n-distances

Counting bounded elements of a number field

Edge-ordered Ramsey numbers

F-inverse monoids as algebraic structures in enriched signature

Inequalities for doubly nonnegative functions

The Fuglede conjecture for convex domains is true in all dimensions

Risk-neutral pricing for APT

Polarization, sign sequences and isotropic vector systems

New bounds on even cycle creating Hamiltonian paths using expander graphs

The mixing time of the switch Markov chains: a unified approach

On the discrepancy of random subsequences of ${n α}$

The domination number of the graph defined by two levels of the $n$ -cube, II

On polyhedra inscribed in $S^{2}$ , with approximately equal edges

On $L$ -close Sperner systems

On the best constants associated with $n$ -distances

$F$ -inverse monoids as algebraic structures in enriched signature