1 citations · 3 across the 8 of their papers we have counts for
11 papers
A Link between Coding Theory and Cross-Validation with Applications
Tapio Pahikkala, Parisa Movahedi, Ileana Montoya +4
How many different binary classification problems a single learning algorithm can solve on a fixed data with exactly zero or at most a given number of cross-validation errors? Whil…
Packing of permutations into Latin squares
Stephan Foldes, András Kaszanyitzky, Laszlo Major
For every positive integer greater than there is a set of Latin squares of order such that every permutation of the numbers appears exactly once as a row,…
Log-concavity of rows of Pascal type triangles
Stephan Foldes, Laszlo Major
Menon's proof of the preservation of log-concavity of sequences under convolution becomes simpler when adapted to 2-sided infinite sequences. Under assumption of log-concavity of t…
The Unimodality Conjecture for cubical polytopes
László Major, Szabolcs Tóth
Although the Unimodality Conjecture holds for some certain classes of cubical polytopes (e.g. cubes, capped cubical polytopes, neighborly cubical polytopes), it fails for cubical p…
On the polyhedral cones of convex and concave vectors
Stephan Foldes, Laszlo Major
Convex or concave sequences of positive terms, viewed as vectors in -space, constitute convex cones with and extreme rays, respectively. Explicit description is g…
On face numbers of neighborly cubical polytopes
Laszlo Major
Neighborly cubical polytopes are known as the cubical analogues of the cyclic polytopes. Using the short cubical -vectors of cubical polytopes (introduced by Adin), we derive an…
Log-concavity of face vectors of cyclic and ordinary polytopes
Laszlo Major
Ordinary polytopes are known as a non-simplicial generalization of the cyclic polytopes. The face vectors of ordinary polytopes are shown to be log-concave.
Unimodality of f-vectors of cyclic polytopes
László Major
Cyclic polytopes are generally known for being involved in the Upper Bound Theorem, but they have another extremal property which is less well known. Namely, the special shape of t…
The Cauchy-Schwarz inequality in Cayley graph and tournament structures on finite fields
Stephan Foldes, Laszlo Major
The Cayley graph construction provides a natural grid structure on a finite vector space over a field of prime or prime square cardinality, where the characteristic is congruent to…
Generalized asymptotic Euler's relation for certain families of polytopes
Laszlo Major
According to Euler's relation any polytope P has as many faces of even dimension as it has faces of odd dimension. As a generalization of this fact one can compare the number of fa…
On the distribution of coefficients of residue polynomials
Laszlo Major
Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.