output
19942026
most citedBrownian distance covariance

857 citations

Showing 2014Show all

53 papers · 1 filter

math.GR2014★ 1 cited

On the number of -degree characters in a finite group

Gunter Malle, Attila Maróti

Let be a prime divisor of the order of a finite group . Then has at least complex irreducible characters of degrees prime to . In case is a prime w…

math.NT2014★ 1 cited

Links between generalized Montréal-functors

Márton Erdélyi, Gergely Zábrádi

Let be the ring of integers in a finite extension and be the -points of a -split reductive group $\mat…

math.LO2014★ 10 cited

Changing a semantics: opportunism or courage?

H. Andréka, J. F. A. K. van Benthem, N. Bezhanishvili +1

The generalized models for higher-order logics introduced by Leon Henkin, and their multiple offspring over the years, have become a standard tool in many areas of logic. Even so,…

math.CO2014★ 1 cited

The Disjoint Domination Game

Csilla Bujtás, Zsolt Tuza

We introduce and study a Maker-Breaker type game in which the issue is to create or avoid two disjoint dominating sets in graphs without isolated vertices. We prove that the maker…

math.AG2014

The Milnor fiber of the singularity f(x,y) + zg(x,y) = 0

Baldur Sigurðsson

We give a description of the Milnor fiber and the monodromy of a singularity of the form f+zg = 0 where f and g define plane curves and have no common components. The description d…

math.GR2014★ 1 cited

A lower bound for the number of conjugacy classes of a finite group

Attila Maróti

Every finite group whose order is divisible by a prime has at least conjugacy classes.

stat.CO2014★ 3 cited

Fast Computing for Distance Covariance

Xiaoming Huo, Gabor J. Szekely

Distance covariance and distance correlation have been widely adopted in measuring dependence of a pair of random variables or random vectors. If the computation of distance covari…

math.MG2014★ 6 cited

A fractional Helly theorem for boxes

I. Bárány, F. Fodor, A. Martínez-Pérez +3

Let be a family of axis-parallel boxes in and a real number. There exists a real number such that if there are $α{n\choos…

math.CO2014★ 1 cited

Induced cycles in triangle graphs

Aparna Lakshmanan S., Csilla Bujtás, Zsolt Tuza

The triangle graph of a graph , denoted by , is the graph whose vertices represent the triangles ( subgraphs) of , and two vertices of are adj…

math.LO2014

Characterization of order types of pointwise linearly ordered families of Baire class 1 functions

Márton Elekes, Zoltán Vidnyánszky

In the 1970s M. Laczkovich posed the following problem: Let denote the set of Baire class functions defined on an uncountable Polish space equipped with…

math.MG2014

Isotropic measures, and stronger forms of the reverse isoperimetric inequality

Karoly J. Boroczky, Daniel Hug

A stability version of the reverse isoperimetric inequality, and the corresponding inequality for isotropic measures are established.

math.CO2014★ 1 cited

An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes

Balázs Keszegh, Dömötör Pálvölgyi

The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets. We introduce an abstract ver…

math.CO2014★ 9 cited

An improvement on the Delsarte-type LP-bound with application to MUBs

M. Matolcsi, M. Weiner

The linear programming (LP) bound of Delsarte can be applied to several problems in various branches of mathematics. We describe a general Fourier analytic method to get a slight i…

math.PR2014

Further properties of a random graph with duplications and deletions

Ágnes Backhausz, Tamás F. Móri

We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probabil…

math.LO2014

Finite-variable logics do not have weak Beth definability property

H. Andréka, I. Németi

We prove that n-variable logics do not have the weak Beth definability property, for all n greater than 2. This was known for n=3 (Ildikó Sain and András Simon), and for n greater…

math.GT2014★ 14 cited

The topology of Stein fillable manifolds in high dimensions II

Jonathan Bowden, Diarmuid Crowley, András I. Stipsicz +1

We continue our study of contact structures on manifolds of dimension at least five using complex surgery theory. We show that in each dimension 2q+1 > 3 there are 'maximal' almost…

math.SG2014★ 6 cited

Estimating the number of Reeb chords using a linear representation of the characteristic algebra

Georgios Dimitroglou Rizell, Roman Golovko

Given a chord-generic horizontally displaceable Legendrian submanifold with the property that its characteristic algebra admits a finite-dimensional ma…

math.GT2014★ 20 cited

Cuspidal curves and Heegaard Floer homology

József Bodnár, Daniele Celoria, Marco Golla

We give bounds on the gap functions of the singularities of a cuspidal plane curve of arbitrary genus, generalising recent work of Borodzik and Livingston. We apply these inequalit…

math.MG2014★ 17 cited

Squares and their centers

Tamás Keleti, Dániel T. Nagy, Pablo Shmerkin

We study the relationship between the sizes of two sets when contains either the whole boundary, or the four vertices, of a square with axes-parallel…

math.CO2014

On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs

Pablo Candela, Balázs Szegedy, Lluís Vena

We prove an arithmetic removal result for all compact abelian groups, generalizing a finitary removal result of Král', Serra and the third author. To this end, we consider infinite…

math.CO2014★ 21 cited

An improvement of the general bound on the largest family of subsets avoiding a subposet

Dániel Grósz, Abhishek Methuku, Casey Tompkins

Let be the maximum size of a family of subsets of not containing as a (weak) subposet, and let be the length of a longest chain in .…

math.CO2014★ 27 cited

The approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result

Jan Hladký, János Komlós, Diana Piguet +3

This is the last paper of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every there exists a number~ such th…

math.CO2014

The Density Turán problem

Péter Csikvári, Zoltán Lóránt Nagy

Let be a graph on vertices and let the blow-up graph be defined as follows. We replace each vertex of by a cluster and connect some pairs of vertices…

math.CO2014

On the dimension of additive sets

P. Candela, H. A. Helfgott

We study the relations between several notions of dimension for an additive set, some of which are well-known and some of which are more recent, appearing for instance in work of S…