15 citations · 22 across the 4 of their papers we have counts for
4 papers
Combinatorial invariants for graph isomorphism problem
Jarek Duda
Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For exa…
Complex base numeral systems
Jarek Duda
In this paper will be introduced large, probably complete family of complex base systems, which are 'proper' - for each point of the space there is a representation which is unique…
Analysis of the convex hull of the attractor of an IFS
Jarek Duda
In this paper we will introduce the methodology of analysis of the convex hull of the attractors of iterated functional systems (IFS) - compact fixed sets of self-similarity mappin…
Optimal encoding on discrete lattice with translational invariant constrains using statistical algorithms
Jarek Duda
In this paper will be presented methodology of encoding information in valuations of discrete lattice with some translational invariant constrains in asymptotically optimal way. Th…