Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Major, Laszlo"'
Autor:
Pahikkala, Tapio, Movahedi, Parisa, Montoya, Ileana, Miikonen, Havu, Foldes, Stephan, Airola, Antti, Major, Laszlo
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? While the number in the former case is known to be limited by the no-free-
Externí odkaz:
http://arxiv.org/abs/2103.11856
For every positive integer $n$ greater than $4$ there is a set of Latin squares of order $n$ such that every permutation of the numbers $1,\ldots,n$ appears exactly once as a row, a column, a reverse row or a reverse column of one of the given Latin
Externí odkaz:
http://arxiv.org/abs/1912.11710
Autor:
Foldes, Stephan, Major, Laszlo
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 two 2-sided infinite sequences, the existence of the convolution is cha
Externí odkaz:
http://arxiv.org/abs/1608.04126
Publikováno v:
In Discrete Applied Mathematics 15 July 2021 297:102-108
Autor:
Major, László, Tóth, Szabolcs
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 polytopes in general. A 12-dimensional cubical polytope with non-unimod
Externí odkaz:
http://arxiv.org/abs/1501.00430
Autor:
Foldes, Stephan, Major, Laszlo
Convex or concave sequences of $n$ positive terms, viewed as vectors in $n$-space, constitute convex cones with $2n-2$ and $n$ extreme rays, respectively. Explicit description is given of vectors spanning these extreme rays, as well as of non-singula
Externí odkaz:
http://arxiv.org/abs/1312.0561
Autor:
Major, Laszlo
Neighborly cubical polytopes are known as the cubical analogues of the cyclic polytopes. Using the short cubical $h$-vectors of cubical polytopes (introduced by Adin), we derive an explicit formula for the face numbers of the neighborly cubical polyt
Externí odkaz:
http://arxiv.org/abs/1310.3881
Autor:
Major, Laszlo
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.
Comment: 4 pages
Comment: 4 pages
Externí odkaz:
http://arxiv.org/abs/1112.1713
Autor:
Major, László
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 their f-vectors makes them applicable to certain constructions to prese
Externí odkaz:
http://arxiv.org/abs/1106.4597
Autor:
Foldes, Stephan, Major, Laszlo
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 3 modulo 4, in addition to the quadratic residue tournament structure
Externí odkaz:
http://arxiv.org/abs/1001.0046