Stephan Foldes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Stephan Foldes has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Miguel Couceiro
INESC-ID, Instituto Superior Técnico, Universidade de Lisboa, Lisbon, Portugal
6 shared publications Peter L. Hammer
Tampere Univ Technol, Inst Math, FIN-33101 Tampere, Finland
6 shared publications- Sándor Radeleczki
Institute of Mathematics, University of Miskolc, Miskolc, Hungary
4 shared publications - Jenő Szigeti
Institute of Mathematics, University of Miskolc, Miskolc, Hungary 3515
3 shared publications Adi Ben-Israel
2 shared publications- Erkko Lehtonen
Institut für Algebra, Technische Universität Dresden, Dresden, Germany
2 shared publications
Latest Publications
- 20 October 2017
- Published by Springer Nature in Algebra universalis
- Vol. 78 (4) , 545-553
On homomorphisms between products of median algebras
- 20 October 2017
- Published by Springer Nature in Algebra universalis
- Vol. 78 (4) , 545-553
On homomorphisms between products of median algebras
- Open Access
- 1 September 2016
- Published by Walter de Gruyter GmbH in Demonstratio Mathematica
- Vol. 49 (3) , 271-281
Interval Decomposition Lattices are Balanced
- 1 September 2016
- Published by Walter de Gruyter GmbH in Demonstratio Mathematica
- Vol. 49 (3) , 271-281
Open AccessInterval Decomposition Lattices are Balanced
- 7 December 2015
- Published by Springer Nature in Algebra universalis
- Vol. 75 (4) , 439-449
Which self-maps appear as lattice anti-endomorphisms?
- 7 December 2015
- Published by Springer Nature in Algebra universalis
- Vol. 75 (4) , 439-449
Which self-maps appear as lattice anti-endomorphisms?
- Open Access
On closed sets of relational constraints and classes of functions closed under variable substitutions
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 $A$ and $B$ may be finite or infinite.Open AccessOn closed sets of relational constraints and classes of functions closed under variable substitutions
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 $A$ and $B$ may be finite or infinite. - 1 January 2015
- Published by Springer Nature in Acta Scientiarum Mathematicarum
- Vol. 81 (12) , 3-24
A general framework for island systems
- 1 January 2015
- Published by Springer Nature in Acta Scientiarum Mathematicarum
- Vol. 81 (12) , 3-24
A general framework for island systems
- Open Access
Which self-maps appear as lattice anti-endomorphisms?
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.
Open AccessWhich self-maps appear as lattice anti-endomorphisms?
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.
- Open Access
Note on islands in path-length sequences of binary trees
An earlier characterization of topologically ordered (lexicographic) path-length sequences of binary trees is reformulated in terms of an integrality condition on a scaled Kraft sum of certain subsequences (full segments, or islands). The scaled Kraft sum is seen to count the set of ancestors at a certain level of a set of topologically consecutive leaves is a binary tree.
Open AccessNote on islands in path-length sequences of binary trees
An earlier characterization of topologically ordered (lexicographic) path-length sequences of binary trees is reformulated in terms of an integrality condition on a scaled Kraft sum of certain subsequences (full segments, or islands). The scaled Kraft sum is seen to count the set of ancestors at a certain level of a set of topologically consecutive leaves is a binary tree.
- 1 January 2014
- Published by Mathematical Notes in Miskolc Mathematical Notes
- Vol. 15 (1) , 153
The Cauchy-Schwarz inequality in Cayley graph and tournament structures on finite fields
- 1 January 2014
- Published by Mathematical Notes in Miskolc Mathematical Notes
- Vol. 15 (1) , 153
The Cauchy-Schwarz inequality in Cayley graph and tournament structures on finite fields
- Open Access
On the polyhedral cones of convex and concave vectors
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-singular linear transformations between the positive orthant and the simplicial cones formed by the positive concave vectors. The simplicial cones of monotone convex and concave vectors can be described similarly.Open AccessOn the polyhedral cones of convex and concave vectors
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-singular linear transformations between the positive orthant and the simplicial cones formed by the positive concave vectors. The simplicial cones of monotone convex and concave vectors can be described similarly. - Open Access
Interval decomposition lattices are balanced
Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in a linearly ordered set. Join-irreducible partitions into intervals are characterized in the lattice of all interval decompositions of a set, in a general sense of intervals defined axiomatically. This characterization is used to show that the lattice of interval decompositions is balanced.
Open AccessInterval decomposition lattices are balanced
Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in a linearly ordered set. Join-irreducible partitions into intervals are characterized in the lattice of all interval decompositions of a set, in a general sense of intervals defined axiomatically. This characterization is used to show that the lattice of interval decompositions is balanced.