Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Sándor Z Kiss"'
Publikováno v:
PLoS ONE, Vol 10, Iss 7, p e0131300 (2015)
In 1999 Kannan, Tetali and Vempala proposed a MCMC method to uniformly sample all possible realizations of a given graphical degree sequence and conjectured its rapidly mixing nature. Recently their conjecture was proved affirmative for regular graph
Externí odkaz:
https://doaj.org/article/2e90056615b84fc6b55d4d6455ab4442
Autor:
Sándor Z. Kiss, Csaba Sándor
Publikováno v:
The Ramanujan Journal. 59:351-363
For $$h \ge 2$$ h ≥ 2 and an infinite set of positive integers A, let $$R_{A,h}(n)$$ R A , h ( n ) denote the number of representations of the positive integer n as the sum of h distinct terms from A. A set of positive integers A is called a $$B_h[
Autor:
Vinh Hung Nguyen, Sándor Z. Kiss
Publikováno v:
Bulletin of the Australian Mathematical Society. 104:211-217
Let k and l be positive integers satisfying $k \ge 2, l \ge 1$ . A set $\mathcal {A}$ of positive integers is an asymptotic basis of order k if every large enough positive integer can be represented as the sum of k terms from $\mathcal {A}$ . About 3
Autor:
Sándor Z. Kiss, Csaba Sándor
Publikováno v:
Acta Arithmetica. 200:213-220
Two infinite sets $A$ and $B$ of nonnegative integers are called additive complements if their sumset contains every nonnegative integer. In 1964, Danzer constructed infinite additive complements $A$ and $B$ with $A(x)B(x) = (1 + o(1))x$ as $x \right
Autor:
Sándor Z. Kiss, Péter Kutas
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing.
We propose a new identification system based on algorithmic problems related to computing isomorphisms between central simple algebras. We design a statistical zero knowledge protocol which relies on the hardness of computing isomorphisms between ord
Autor:
Sándor Lipcsei, Sándor Z. Kiss
Publikováno v:
Annals of Nuclear Energy. 124:327-334
In this paper the propagation mechanism of the temperature fluctuations of the coolant is investigated using the measured hot and cold leg temperature signals of the primary loops of a VVER-440 reactor. The aim of the investigation was to provide an
Publikováno v:
SIAM Journal on Discrete Mathematics. 32:2453-2466
Let ${\mathbb Z}^{+}$ be the set of positive integers. Let $C_{k}$ denote all subsets of ${\mathbb Z}^{+}$ such that none of them contains $k + 1$ pairwise coprime integers and $C_k(n)=C_k\cap \{1,...
Autor:
Csaba Sándor, Sándor Z. Kiss
Let h , k ≥ 2 be integers. We say a set A of positive integers is an asymptotic basis of order k if every large enough positive integer can be represented as the sum of k terms from A . A set of positive integers A is called a B h [ g ] set if ever
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24bfa9549ebd8e64f363de8ef4e1abed
Autor:
Csaba Sándor, Sándor Z. Kiss
Publikováno v:
The Ramanujan Journal. 44:385-399
Let A be a set of positive integers. For a fixed \(k \ge 1\) and a positive integer n let \(R_{A, k}(n)\) denote the number of representations of n as the sum of k terms from the set A. In this paper we give a necessary and sufficient condition to th
Autor:
Csaba Sándor, Sándor Z. Kiss
Publikováno v:
International Journal of Number Theory. 12:1055-1075
Let [Formula: see text] and [Formula: see text] be infinite sequences of nonnegative integers. For a positive integer [Formula: see text] let [Formula: see text] denote the number of representations of [Formula: see text] as the sum of two terms from