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 2024Show all

45 papers · 1 filter

math.CO2024

Multisets with few special directions and small weight codewords in Desarguesian planes

Sam Adriaensen, Tamás Szőnyi, Zsuzsa Weiner

In this paper, we tie together two well studied topics related to finite Desarguesian affine and projective planes. The first topic concerns directions determined by a set, or even…

math.MG2024

Estimates on the decay of the Laplace-Polya integral

Gergely Ambrus, Barnabás Gárgyán

The Laplace--Pólya integral, defined by $J_{n} (r) = \frac{1}{π} \int_{- \infty}^{\infty} sinc^{n} t cos (r t) d t$ , appears in several areas of mathematics. We study this q…

cs.DM2024

A Stopping Game on Zero-Sum Sequences

Adrian Dumitrescu, Arsenii Sagdeev

We introduce and analyze a natural game formulated as follows. In this one-person game, the player is given a random permutation $A = (a_{1}, \dots, a_{n})$ of a multiset $M$ of $n$ reals…

math.MG2024★ 1 cited

Isometric rigidity of the Wasserstein space over the plane with the maximum metric

Zoltán M. Balogh, Gergely Kiss, Tamás Titkos +1

We study $p$ -Wasserstein spaces over the branching spaces $R^{2}$ and $[- 1, 1]^{2}$ equipped with the maximum norm metric. We show that these spaces are isometrically rigid for…

physics.soc-ph2024★ 4 cited

Decoding how higher-order network interactions shape complex contagion dynamics

István Z. Kiss, Christian Bick, Péter L. Simon

Complex contagion models that involve contagion along higher-order structures, such as simplicial complexes and hypergraphs, yield new classes of mean-field models. Interestingly,…

math.MG2024★ 1 cited

Strengthened inequalities for the mean width and the $ℓ$ -norm of origin symmetric convex bodies

Károly J. Böröczky, Ferenc Fodor, Daniel Hug

Barthe, Schechtman and Schmuckenschläger proved that the cube maximizes the mean width of symmetric convex bodies whose John ellipsoid (maximal volume ellipsoid contained in the bo…

math.CO2024★ 1 cited

Rigidity and reconstruction in matroids of highly connected graphs

Dániel Garamvölgyi

A graph matroid family $M$ is a family of matroids $M (G)$ defined on the edge set of each finite graph $G$ in a compatible and isomorphism-invariant way. We say…

quant-ph2024★ 1 cited

On the practicality of quantum sieving algorithms for the shortest vector problem

Joao F. Doriguello, George Giapitzakis, Alessandro Luongo +1

One of the main candidates of post-quantum cryptography is lattice-based cryptography. Its cryptographic security against quantum attackers is based on the worst-case hardness of l…

math.DS2024

Shifts of Finite Type Obtained by Forbidding a Single Pattern

Nishant Chandgotia, Brian Marcus, Jacob Richey +1

Given a finite word $w$ , Guibas and Odlyzko (J. Combin. Theory Ser. A, 30, 1981, 183-208) showed that the autocorrelation polynomial $ϕ_{w} (t)$ of $w$ , which records the set of self-…

math.CO2024

Piercing intersecting convex sets

Imre Bárány, Travis Dillon, Dömötör Pálvölgyi +1

Assume two finite families $A$ and $B$ of convex sets in $R^{3}$ have the property that $A \cap B \neq = \emptyset$ for every $A \in A$ and $B\in \math…

math.LO2024

Transposition of variables is hard to describe

H. Andréka, I. Németi, Zs. Tuza

The function $p_{x y}$ that interchanges two logical variables $x, y$ in formulas is hard to describe in the following sense. Let $F$ denote the Lindenbaum-Tarski formula-algebra of…

math.CO2024

The complexity of recognizing $A B A B$ -free hypergraphs

Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi +1

The study of geometric hypergraphs gave rise to the notion of $A B A B$ -free hypergraphs. A hypergraph $H$ is called $A B A B$ -free if there is an ordering of its vertices such…

math.FA2024★ 1 cited

Operator means, barycenters, and fixed point equations

Dániel Virosztek

The seminal work of Kubo and Ando from 1980 provided us with an axiomatic approach to means of positive operators. As most of their axioms are algebraic in nature, this approach ha…

math.CO2024★ 1 cited

Monochromatic graph decompositions inspired by anti-Ramsey theory and the odd-coloring problem

Yair Caro, Zsolt Tuza

We consider extremal edge-coloring problems inspired by the theory of anti-Ramsey / rainbow coloring, and further by odd-colorings and conflict-free colorings. Let $G$ be a graph,…

quant-ph2024★ 3 cited

A little bit of self-correction

Michael J. Kastoryano, Lasse B. Kristensen, Chi-Fang Chen +1

We investigate the emergence of stable subspaces in the low-temperature quantum thermal dynamics of finite spin chains. Our analysis reveals the existence of effective decoherence-…

math-ph2024★ 2 cited

Isometries of the qubit state space with respect to quantum Wasserstein distances

Richárd Simon, Dániel Virosztek

In this paper we study isometries of quantum Wasserstein distances and divergences on the quantum bit state space. We describe isometries with respect to the symmetric quantum Wass…

math.CO2024★ 5 cited

Proper edge colorings of planar graphs with rainbow $C_{4}$ -s

András Gyárfás, Ryan R. Martin, Miklós Ruszinkó +1

We call a proper edge coloring of a graph $G$ a B-coloring if every 4-cycle of $G$ is colored with four different colors. Let $q_{B} (G)$ denote the smallest number of colors needed f…

math.CO2024

Brooks' type theorems for coloring parameters of locally finite graphs and Konig's Lemma

Amitayu Banerjee, Zalán Molnár, Alexa Gopaulsingh

In the past, analogues to Brooks' theorem have been found for various parameters of graph coloring for infinite locally finite connected graphs in ZFC. We prove these theorems are…

quant-ph2024★ 2 cited

Barycentric bounds on the error exponents of quantum hypothesis exclusion

Kaiyuan Ji, Hemant K. Mishra, Milán Mosonyi +1

Quantum state exclusion is an operational task with application to ontological interpretations of quantum states. In such a task, one is given a system whose state is randomly sele…

math.CO2024

Packing Density of Sets With Only Two Nonmixed Gaps

Alexander Natalchenko, Arsenii Sagdeev

For a finite set of integers such that the first few gaps between its consecutive elements equal $a$ , while the remaining gaps equal $b$ , we study dense packings of its translates…

quant-ph2024★ 18 cited

Path Percolation in Quantum Communication Networks

Xiangyi Meng, Bingjie Hao, Balázs Ráth +1

In a quantum communication network, links represent entanglement between qubits located at different nodes. Even if two nodes are not directly linked by shared entanglement, commun…

math.CO2024

The diameter of random Schreier graphs

Daniele Dona, Luca Sabatini

We give a combinatorial proof of the following theorem. Let $G$ be any finite group acting transitively on a set of cardinality $n$ . If $S \subseteq G$ is a random set of size $k$ ,…

math.CO2024

Diverse beam search to find densest-known planar unit distance graphs

Peter Engel, Owen Hammond-Lee, Yiheng Su +2

This paper addresses the problem of determining the maximum number of edges in a unit distance graph (UDG) of $n$ vertices using computer search. An unsolved problem of Paul Erdős…

math.CO2024

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs

Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev +2

For an ordered point set in a Euclidean space or, more generally, in an abstract metric space, the ordered Nearest Neighbor Graph is obtained by connecting each of the points to it…

Multisets with few special directions and small weight codewords in Desarguesian planes

Estimates on the decay of the Laplace-Polya integral

A Stopping Game on Zero-Sum Sequences

Isometric rigidity of the Wasserstein space over the plane with the maximum metric

Decoding how higher-order network interactions shape complex contagion dynamics

Strengthened inequalities for the mean width and the ℓ-norm of origin symmetric convex bodies

Rigidity and reconstruction in matroids of highly connected graphs

On the practicality of quantum sieving algorithms for the shortest vector problem

Shifts of Finite Type Obtained by Forbidding a Single Pattern

Piercing intersecting convex sets

Transposition of variables is hard to describe

The complexity of recognizing ABAB-free hypergraphs

Operator means, barycenters, and fixed point equations

Monochromatic graph decompositions inspired by anti-Ramsey theory and the odd-coloring problem

A little bit of self-correction

Isometries of the qubit state space with respect to quantum Wasserstein distances

Proper edge colorings of planar graphs with rainbow C4​-s

Brooks' type theorems for coloring parameters of locally finite graphs and Konig's Lemma

Barycentric bounds on the error exponents of quantum hypothesis exclusion

Packing Density of Sets With Only Two Nonmixed Gaps

Path Percolation in Quantum Communication Networks

The diameter of random Schreier graphs

Diverse beam search to find densest-known planar unit distance graphs

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs

Strengthened inequalities for the mean width and the $ℓ$ -norm of origin symmetric convex bodies

The complexity of recognizing $A B A B$ -free hypergraphs

Proper edge colorings of planar graphs with rainbow $C_{4}$ -s