Zobrazeno 1 - 10
of 124
pro vyhledávání: '"Foldes, Stephan"'
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
Autor:
Foldes, Stephan, Woodroofe, Russ
Publikováno v:
Proc. Amer. Math. Soc. 150 (2022), 31-39
We characterize supersolvable lattices in terms of a certain modular type relation. McNamara and Thomas earlier characterized this class of lattices as those graded lattices having a maximal chain that consists of left-modular elements. Our character
Externí odkaz:
http://arxiv.org/abs/2011.11657
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
An alternative proof is given of the existence of greatest lower bounds in the imbalance order of binary maximal instantaneous codes of a given size. These codes are viewed as maximal antichains of a given size in the infinite binary tree of 0-1 word
Externí odkaz:
http://arxiv.org/abs/1702.06438
Publikováno v:
In Discrete Applied Mathematics 15 July 2021 297:102-108
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
We characterize trees as median algebras and semilattices by relaxing conservativeness. Moreover, we describe median homomorphisms between products of median algebras and show that Arrow type impossibility theorems for mappings from a product $\mathb
Externí odkaz:
http://arxiv.org/abs/1508.04741
Autor:
Couceiro, Miguel, Foldes, Stephan
Publikováno v:
Algebra Universalis 54 (2005) 149-165
Pippenger's Galois theory of finite functions and relational constraints is extended to the infinite case. The functions involved are functions of several variables on a set $A$ and taking values in a possibly different set $B$, where any or both of
Externí odkaz:
http://arxiv.org/abs/1508.01558
Autor:
Foldes, Stephan, Szigeti, Jeno
Let f be a self-map of the set A. We give a necessary and sufficient condition for the existence of a lattice structure on A such that f becomes a lattice anti-endomorphism with respect to this structure.
Externí odkaz:
http://arxiv.org/abs/1411.3481