S. Z. Kiss

activity

20092026

most citedConstructing, sampling and counting graphical realizations of restricted degree sequences

27 citations · 32 across the 16 of their papers we have counts for

collaborators

22 papers

quant-ph2026

Using domain walls to benchmark fast quantum anneals

Shushmi Chowdhury, Asa Hopkins, Nick Chancellor +1

We consider the distribution of domain walls arising in ground states of frustrated 1-dimensional Ising spin chains with anti-parallel boundary spins. For ideal chains, a sine-squa…

cs.IT2023

On Linear Codes with Random Multiplier Vectors and the Maximum Trace Dimension Property

Márton Erdélyi, Pál Hegedüs, Sándor Z. Kiss +1

Let $C$ be a linear code of length $n$ and dimension $k$ over the finite field $F_{q^{m}}$ . The trace code $Tr (C)$ is a linear code of the same length $n$ over the…

math.NT2023

Unique representations of integers by linear forms

Sándor Z. Kiss, Csaba Sándor

Let $k \geq 2$ be an integer and let $A$ be a set of nonnegative integers. For a $k$ -tuple of positive integers $λ = (λ_{1}, \dots, λ_{k})$ with $1 \le λ_{1} < λ_{2} < \d…

math.NT2023

On monotone increasing representation functions

Sándor Z. Kiss, Csaba Sándor, Quan-Hui Yang

Let $k \geq 2$ be an integer and let $A$ be a set of nonnegative integers. The representation function $R_{A, k} (n)$ for the set $A$ is the number of representations of a nonnegative…

math.NT2022★ 1 cited

On $B_{h} [1]$ -sets which are asymptotic bases of order $2 h$

Sándor Z. Kiss, Csaba Sándor

Let $h, k \geq 2$ be integers. A set $A$ of positive integers is called asymptotic basis of order $k$ if every large enough positive integer can be written as the sum of $k$ terms fr…

math.NT2021

Dense sumsets of Sidon sequences

Sándor Z. Kiss, Csaba Sándor

Let $k \geq 2$ be an integer. 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$ t…

math.NT2020

On a problem of Chen and Fang related to infinite additive complements

Sándor Z. Kiss, Csaba Sándor

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 addit…

math.NT2020

Generalized Sidon sets of perfect powers

Sandor Kiss, Csaba Sandor

For $h \geq 2$ and an infinite set of positive integers $A$ , let $R_{A, h} (n)$ denote the number of solutions of the equation $a_{1} + a_{2} + \dots{} + a_{h} = n, a_{1} \in A, \dots…

math.NT2019

Generalized asymptotic Sidon basis

Sándor Z. Kiss, Csaba Sándor

Let $h, k \geq 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$ t…

math.RA2018

An identification system based on the explicit isomorphism problem

Sándor Z. Kiss, Péter Kutas

We propose a new identification system based on algorithmic problems related to computing isomorphisms between central simple algebras. We design a statistical zero knowledge proto…

math.NT2018

Generalizations of some results about the regularity properties of an additive representation function

Sándor Z. Kiss, Csaba Sándor

Let $A = {a_{1}, a_{2}, \dots}$ $(a_{1} < a_{2} < \dots)$ be an infinite sequence of nonnegative integers, and let $R_{A, 2} (n)$ denote the number of solutions of $a_{x}+a_{y}=n…

math.NT2017★ 1 cited

On generalized Stanley sequences

Sándor Z. Kiss, Csaba Sándor, Quan-Hui Yang

Let $N$ denote the set of all nonnegative integers. Let $k \geq 3$ be an integer and $A_{0} = {a_{1}, \dots, a_{t}}$ $(a_{1} < \dots < a_{t})$ be a nonnegative set which…

math.NT2017

On a conjecture of Erdős about sets without $k$ pairwise coprime integers

Sándor Z. Kiss, Csaba Sándor, Quan-Hui Yang

Let $Z^{+}$ be the set of positive integers. Let $C_{k}$ denote all subsets of $Z^{+}$ such that neither of them contains $k + 1$ pairwise coprime integers and $C…

math.NT2017

On minimal additive complements of integers

Sándor Z. Kiss, Csaba Sándor, Quan-Hui Yang

Let $C, W \subseteq Z$ . If $C + W = Z$ , then the set $C$ is called an additive complement to $W$ in $Z$ . If no proper subset of $C$ is an additive complement t…

math.NT2017

On the structure of sets which have coinciding representation functions

Sándor Z. Kiss, Csaba Sándor

For a set of nonnegative integers $A$ , denote by $R_{A} (n)$ the number of unordered representations of the integer $n$ as the sum of two different terms from $A$ . In this paper we…

math.NT2016

Partitions of the set of nonnegative integers with the same representation functions

Sándor Z. Kiss, Csaba Sándor

For a set of nonnegative integers $S$ let $R_{S} (n)$ denote the number of unordered representations of the integer $n$ as the sum of two different terms from $S$ . In this paper we…

math.NT2015★ 1 cited

On the maximum values of the additive representation functions

Sándor Z. Kiss, Csaba Sándor

Let $A$ and $B$ be sets of nonnegative integers. For a positive integer $n$ let $R_{A} (n)$ denote the number of representations of $n$ as the sum of two terms from $A$ . Let $\displ…

math.NT2013

On Sidon sets which are asymptotic bases of order 4

Sándor Z. Kiss, Eszter Rozgonyi, Csaba Sándor

In this paper we prove the existence of Sidon sets which are asymptotic bases of order 4 by using probabilistic methods.

math.NT2013

On additive complement of a finite set

Sándor Z. Kiss, Eszter Rozgonyi, Csaba Sándor

We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang…

cs.CE2013★ 2 cited

On sampling SCJ rearrangement scenarios

Istvan Miklos, Sandor Z. Kiss, Eric Tannier

The Single Cut or Join (SCJ) operation on genomes, generalizing chromosome evolution by fusions and fissions, is the computationally simplest known model of genome rearrangement. W…

math.CO2013★ 27 cited

Constructing, sampling and counting graphical realizations of restricted degree sequences

Péter L. Erdös, Sándor Z. Kiss, István Miklós +1

With the current burst of network theory (especially in connection with social and biological networks) there is a renewed interest on realizations of given degree sequences. In th…

math.NT2009

Generalization of a theorem of Erdos and Renyi on Sidon Sequences

Javier Cilleruelo, Sandor Z. Kiss, Imre Z. Ruzsa +1

Erd\H os and Rényi claimed and Vu proved that for all $h \geq 2$ and for all $ε > 0$ , there exists $g = g_{h} (ε)$ and a sequence of integers $A$ such that the number of ordered represe…

Using domain walls to benchmark fast quantum anneals

On Linear Codes with Random Multiplier Vectors and the Maximum Trace Dimension Property

Unique representations of integers by linear forms

On monotone increasing representation functions

On Bh​[1]-sets which are asymptotic bases of order 2h

Dense sumsets of Sidon sequences

On a problem of Chen and Fang related to infinite additive complements

Generalized Sidon sets of perfect powers

Generalized asymptotic Sidon basis

An identification system based on the explicit isomorphism problem

Generalizations of some results about the regularity properties of an additive representation function

On generalized Stanley sequences

On a conjecture of Erdős about sets without k pairwise coprime integers

On minimal additive complements of integers

On the structure of sets which have coinciding representation functions

Partitions of the set of nonnegative integers with the same representation functions

On the maximum values of the additive representation functions

On Sidon sets which are asymptotic bases of order 4

On additive complement of a finite set

On sampling SCJ rearrangement scenarios

Constructing, sampling and counting graphical realizations of restricted degree sequences

Generalization of a theorem of Erdos and Renyi on Sidon Sequences

On $B_{h} [1]$ -sets which are asymptotic bases of order $2 h$

On a conjecture of Erdős about sets without $k$ pairwise coprime integers