output
19942026
most citedBrownian distance covariance

857 citations

Showing 2015Show all

55 papers · 1 filter

math.DG2015★ 5 cited

On endomorphisms of the Einstein gyrogroup in arbitrary dimension

Péter E. Frenkel

We determine the automorphisms and the continuous endomorphisms of the Einstein gyrogroup in arbitrary dimension. This generalizes a recent result of Lajos Molnár and Dániel Virosz…

math.RA2015

Noether bound for invariants in relatively free algebras

M. Domokos, V. Drensky

Let be a weakly noetherian variety of unitary associative algebras (over a field of characteristic 0), i.e., every finitely generated algebra from …

math.CO2015

A Combinatorial Problem Related to Sparse Systems of Equations

Peter Horak, Igor Semaev, Zsolt Tuza

Nowadays sparse systems of equations occur frequently in science and engineering. In this contribution we deal with sparse systems common in cryptanalysis. Given a cipher system, o…

math.CA2015★ 13 cited

A potential theoretic minimax problem on the torus

Bálint Farkas, Béla Nagy, Szilárd Gy. Révész

We investigate an extension of an equilibrium-type result, conjectured by Ambrus, Ball and Erdélyi, and proved recently by Hardin, Kendall and Saff. These results were formulated o…

math.GT2015★ 20 cited

The concordance invariant tau in link grid homology

Alberto Cavallo

We introduce a generalization of the Ozsváth-Szabó -invariant to links by studying a filtered version of link grid homology. We prove that this invariant remains unchanged under…

math.RA2015★ 1 cited

Rationality of Hilbert series in noncommutative invariant theory

M. Domokos, V. Drensky

It is a fundamental result in commutative algebra and invariant theory that a finitely generated graded module over a commutative finitely generated graded algebra has rational Hil…

math.CO2015★ 2 cited

-WORM colorings: Results for 2-connected graphs

Csilla Bujtás, Zsolt Tuza

Given two graphs and , an -WORM coloring of is an assignment of colors to its vertices in such a way that no -subgraph of is monochromatic or rainbow. If h…

math.LO2015★ 8 cited

Weak Godel's incompleteness property for some decidable versions of first order logic

Mohamed Khaled

The founding of the theory of cylindric algebras, by Alfred Tarski, was a conscious effort to create algebras out of first order predicate calculus. Let . The classes of non…

math.CO2015★ 6 cited

Chromatic roots and limits of dense graphs

Peter Csikvari, Peter E. Frenkel, Jan Hladky +1

In this short note we observe that recent results of Abert and Hubai and of Csikvari and Frenkel about Benjamini--Schramm continuity of the holomorphic moments of the roots of the…

cs.CG2015

Weight Balancing on Boundaries

Luis Barba, Otfried Cheong, Michael Gene Dobbins +8

Given a polygonal region containing a target point (which we assume is the origin), it is not hard to see that there are two points on the perimeter that are antipodal, that is, wh…

math.LO2015

General normal forms for any additive logic

Mohamed Khaled

In this article, we define general normal forms for any logic that has propositional part and whose non-propositional connectives distribute over the finite disjunctions. We do not…

math.NT2015

Explicit upper bound for an average number of divisors of quadratic polynomials

Kostadinka Lapkova

Consider the divisor sum for integers and which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which…

math.NT2015★ 4 cited

A low-energy decomposition theorem

Antal Balog, Trevor D. Wooley

We prove that any finite set of real numbers can be split into two parts, one part being highly non-additive and the other highly non-multiplicative.

math.CO2015★ 35 cited

Partitioning 2-edge-colored graphs by monochromatic paths and cycles

Jozsef Balogh, Janos Barat, Daniel Gerbner +2

We present results on partitioning the vertices of -edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of Sárköz…

math.CO2015★ 33 cited

Vertex covers by monochromatic pieces - A survey of results and problems

Andras Gyarfas

This survey is devoted to problems and results concerning covering the vertices of edge colored graphs or hypergraphs with monochromatic paths, cycles and other objects. It is an e…

math.CO2015★ 3 cited

Ramsey number of a connected triangle matching

Andras Gyarfas, Gabor N. Sarkozy

We determine the -color Ramsey number of a {\em connected} triangle matching which is any connected graph containing vertex disjoint triangles. We obtain that $R(c…

math.CO2015★ 2 cited

Large Cross-free sets in Steiner triple systems

Andras Gyarfas

A {\em cross-free} set of size in a Steiner triple system is three pairwise disjoint -element subsets such that no in…

math.LO2015★ 5 cited

How many varieties of cylindric algebras

H. Andréka, I. Németi

Cylindric algebras, or concept algebras in another name, form an interface between algebra, geometry and logic; they were invented by Alfred Tarski around 1947. We prove that there…

math.GT2015★ 15 cited

Dehn surgeries and rational homology balls

Paolo Aceto, Marco Golla

We consider the question of which Dehn surgeries along a given knot bound rational homology balls. We use Ozsváth and Szabó's correction terms in Heegaard Floer homology to obtain…

math.DS2015★ 16 cited

Computing all possible graph structures describing linearly conjugate realizations of kinetic systems

Bernadett Acs, Gabor Szederkenyi, Zsolt Tuza +1

In this paper an algorithm is given to determine all possible structurally different linearly conjugate realizations of a given kinetic polynomial system. The solution is based on…

math.CO2015★ 2 cited

Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem

Ervin Győri, Tamás Róbert Mezei

We prove that every simply connected orthogonal polygon of vertices can be partitioned into (simply connected) orthogonal polygons…

math.CO2015

Separation with restricted families of sets

Zsolt Lángi, Márton Naszódi, János Pach +2

Given a finite -element set , a family of subsets is said to separate if any two elements of are separated by at least one member of $\mathc…

math.MG2015★ 8 cited

Algebraic vertices of non-convex polyhedra

Arseniy Akopyan, Imre Bárány, Sinai Robins

In this article we define an algebraic vertex of a generalized polyhedron and show that it is the smallest set of points needed to define the polyhedron. We prove that the indicato…

math.MG2015

Centrally symmetric convex bodies and sections having maximal quermassintegrals

E. Makai, H. Martini

Let , and let be a convex body containing the origin in its interior. In a previous paper we have proved the following. The body is -sym…