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

67 papers · 1 filter

cs.DM2013

Minimum order of graphs with given coloring parameters

Gabor Bacso, Piotr Borowiecki, Mihaly Hujter +1

A complete $k$ -coloring of a graph $G = (V, E)$ is an assignment $φ : V \to {1, \dots, k}$ of colors to the vertices such that no two vertices of the same color are adjacent, and the uni…

math.CO2013★ 20 cited

A new approach to constant term identities and Selberg-type integrals

Gyula Károlyi, Zoltán Lóránt Nagy, Fedor Petrov +1

Selberg-type integrals that can be turned into constant term identities for Laurent polynomials arise naturally in conjunction with random matrix models in statistical mechanics. B…

math.CO2013

Uniformly resolvable decompositions of $K_{v}$ into $P_{3}$ and $K_{3}$ graphs

Salvatore Milici, Zsolt Tuza

In this paper we consider the uniformly resolvable decompositions of the complete graph $K_{v}$ , or the complete graph minus a 1-factor as appropriate, into subgraphs such that each…

math.LO2013★ 10 cited

Haar null sets without $G_{δ}$ hulls

Márton Elekes, Zoltán Vidnyánszky

Let $G$ be an abelian Polish group, e.g. a separable Banach space. A subset $X \subset G$ is called Haar null (in the sense of Christensen) if there exists a Borel set $B \supset X…

math.CO2013★ 30 cited

Crossing numbers and combinatorial characterization of monotone drawings of $K_{n}$

Martin Balko, Radoslav Fulek, Jan Kynčl

In 1958, Hill conjectured that the minimum number of crossings in a drawing of $K_{n}$ is exactly $Z(n) = \frac{1}{4} \lfloor\frac{n}{2}\rfloor \left\lfloor\frac{n-1}{2}\right\rfloor…

math.MG2013★ 2 cited

Decomposition of multiple packings with subquadratic union complexity

János Pach, Bartosz Walczak

Suppose $k$ is a positive integer and $X$ is a $k$ -fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belo…

math.CA2013★ 12 cited

A family of nonlinear difference equations: existence, uniqueness, and asymptotic behavior of positive solutions

Saud M. Alsulami, Paul Nevai, József Szabados +1

We study solutions $(x_{n})_{n \in N}$ of nonhomogeneous nonlinear second order difference equations of the type $\ell_n = x_n ( σ_{n,1} x_{n+1} + σ_{n,0} x_n + σ_{n,-1} x_{…

math.GN2013

Regular spaces of small extent are omega-resolvable

Istvan Juhasz, Lajos Soukup, Zoltan Szentmiklossy

We improve some results of Pavlov and of Filatova, respectively, concerning a problem of Malychin by showing that every regular space X that satisfies Delta(X)>ext(X) is omega-reso…

math.CO2013★ 3 cited

Covering Paths and Trees for Planar Grids

Balázs Keszegh

Given a set of points in the plane, a covering path is a polygonal path that visits all the points. In this paper we consider covering paths of the vertices of an n x m grid. We sh…

math.CA2013★ 9 cited

Bruckner--Garg-type results with respect to Haar null sets in $C [0, 1]$

Richárd Balka, Udayan B. Darji, Márton Elekes

A set $A \subset C [0, 1]$ is \emph{shy} or \emph{Haar null } (in the sense of Christensen) if there exists a Borel set $B \subset C [0, 1]$ and a Borel probability m…

math.CO2013

Approximability of the upper chromatic number of hypergraphs

Csilla Bujtás, Zsolt Tuza

A C-coloring of a hypergraph $H = (X, E)$ is a vertex coloring $φ : X \to N$ such that each edge $E \in E$ has at least two vertices with a common color. T…

math.CO2013★ 1 cited

Maximum uniformly resolvable decompositions of $K_{v}$ and $K_{v} - I$ into 3-stars and 3-cycles

Selda Küçükçifçi, Salvatore Milici, Zsolt Tuza

Let $K_{v}$ denote the complete graph of order $v$ and $K_{v} - I$ denote $K_{v}$ minus a 1-factor. In this article we investigate uniformly resolvable decompositions of $K_{v}$ and $K_v-I…

math.CO2013

Total Transversals and Total Domination in Uniform Hypergraphs

Csilla Bujtás, Michael A. Henning, Zsolt Tuza +1

The first three authors [European J. Combin. 33 (2012), 62--71] established a relationship between the transversal number and the domination number of uniform hypergraphs. In this…

cs.IT2013★ 4 cited

Using multiobjective optimization to map the entropy region of four random variables

Laszlo Csirmaz

Presently the only available method of exploring the 15-dimensional entropy region formed by the entropies of four random variables is the one of Zhang and Yeung from 1998. It is a…

math.CO2013★ 45 cited

Extremal numbers for odd cycles

Zoltan Füredi, David S. Gunderson

We describe the C_{2k+1}-free graphs on n vertices with maximum number of edges. The extremal graphs are unique except for n = 3k-1, 3k, 4k-2, or 4k-1. The value of ex(n,C_{2k+1})…

cs.CR2013

Gruppen secret sharing, or, how to share several secrets if you must?

Laszlo Csirmaz

Each member of an $n$ -person team has a secret, say a password. The $k$ out of $n$ gruppen secret sharing requires that any group of $k$ members should be able to recover the secre…

math.GR2013★ 11 cited

The minimal base size for a p-solvable linear group

Zoltán Halasi, Attila Maróti

Let $V$ be a finite vector space over a finite field of order $q$ and of characteristic $p$ . Let $G \leq G L (V)$ be a $p$ -solvable completely reducible linear group. Then there exist…

math.SG2013★ 4 cited

On homological rigidity and flexibility of exact Lagrangian endocobordisms

Georgios Dimitroglou Rizell, Roman Golovko

We show that an exact Lagrangian cobordism $L \subset R \times P \times R$ from a Legendrian submanifold $Λ \subset P \times R$ to itself satisfies $H_i(L;\mat…

math.CO2013

Topological orderings of weighted directed acyclic graphs

Dániel Gerbner, Balázs Keszegh, Cory Palmer +1

We call a topological ordering of a weighted directed acyclic graph non-negative if the sum of weights on the vertices in any prefix of the ordering is non-negative. We investigate…

cs.DS2013

Improved bounds for the randomized decision tree complexity of recursive majority

Frederic Magniez, Ashwin Nayak, Miklos Santha +3

We consider the randomized decision tree complexity of the recursive 3-majority function. We prove a lower bound of $(1/2 - δ) \cdot 2.5714 3^{h}$ for the two-sided-error randomized dec…

math.CO2013

Incomparable copies of a poset in the Boolean lattice

Gyula O. H. Katona, Dániel T. Nagy

Let $B_{n}$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_{n}$ as many times as possible suc…

math.PR2013

The range of a random walk on a comb

János Pach, Gábor Tardos

The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a wal…

cs.CR2013

Speeding up Deciphering by Hypergraph Ordering

Peter Horak, Zsolt Tuza

The "Gluing Algorithm" of Semaev [Des.\ Codes Cryptogr.\ 49 (2008), 47--60] --- that finds all solutions of a sparse system of linear equations over the Galois field $GF (q)$ --- ha…

stat.OT2013

On the asymptotics of Ajtai-Komlós-Tusnády statistics

L. Rejtő, G. Tusnády

In our days there is a widespread analysis of Wasserstein distances between theoretical and empirical measures. One of the first investigation of the topic is given in the paper wr…

Minimum order of graphs with given coloring parameters

A new approach to constant term identities and Selberg-type integrals

Uniformly resolvable decompositions of Kv​ into P3​ and K3​ graphs

Haar null sets without Gδ​ hulls

Crossing numbers and combinatorial characterization of monotone drawings of Kn​

Decomposition of multiple packings with subquadratic union complexity

A family of nonlinear difference equations: existence, uniqueness, and asymptotic behavior of positive solutions

Regular spaces of small extent are omega-resolvable

Covering Paths and Trees for Planar Grids

Bruckner--Garg-type results with respect to Haar null sets in C[0,1]

Approximability of the upper chromatic number of hypergraphs

Maximum uniformly resolvable decompositions of Kv​ and Kv​−I into 3-stars and 3-cycles

Total Transversals and Total Domination in Uniform Hypergraphs

Using multiobjective optimization to map the entropy region of four random variables

Extremal numbers for odd cycles

Gruppen secret sharing, or, how to share several secrets if you must?

The minimal base size for a p-solvable linear group

On homological rigidity and flexibility of exact Lagrangian endocobordisms

Topological orderings of weighted directed acyclic graphs

Improved bounds for the randomized decision tree complexity of recursive majority

Incomparable copies of a poset in the Boolean lattice

The range of a random walk on a comb

Speeding up Deciphering by Hypergraph Ordering

On the asymptotics of Ajtai-Komlós-Tusnády statistics

Uniformly resolvable decompositions of $K_{v}$ into $P_{3}$ and $K_{3}$ graphs

Haar null sets without $G_{δ}$ hulls

Crossing numbers and combinatorial characterization of monotone drawings of $K_{n}$

Bruckner--Garg-type results with respect to Haar null sets in $C [0, 1]$

Maximum uniformly resolvable decompositions of $K_{v}$ and $K_{v} - I$ into 3-stars and 3-cycles