Related papers: About one problem from NSUCRYPTO'2017 and the imag…
For a binary quadratic form $Q$, we consider the action of $\mathrm{SO}_Q$ on a two-dimensional vector space. This representation yields perhaps the simplest nontrivial example of a prehomogeneous vector space that is not irreducible, and…
Combinatorial optimization plays a crucial role in many industrial applications. While classical computing often struggles with complex instances, quantum optimization emerges as a promising alternative. Here, we present an enhanced…
We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clusters. This problem is known as the clique partitioning…
We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of…
Plateau's problem is not a single conjecture or theorem, but rather an abstract framework, encompassing a number of different problems in several related areas of mathematics. In its most general form, Plateau's problem is to find an…
We identify a cubic holomorphic constraint that subtends the total breaking of N=2 supersymmetry in a vector multiplet and exhibit its microscopic origin. The new constraint leaves behind, at low energies, a vector and the two goldstini, in…
We study the problem of arithmetic billiards from a new perspective. We first raise a similar problem about reflecting lights inside grids. For the solution to this problem, we will give three proofs. Next, we consider a similar problem in…
The problem of computing the optimum of a function on a finite set is an important problem in mathematics and computer science. Many combinatorial problems such as MAX-SAT and MAXCUT can be recognized as optimization problems on the…
Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by $\mathcal{C}(f)=\left\{ {\rm Tr}(af(x)+bx)_{x \in \mathbb{F}_{q^m}^*}: a,b \in…
SIS problem has numerous applications in cryptography. Known algorithms for solving that problem are exponential in complexity. A new algorithm is suggested in this note, its complexity is sub-exponential for a range of parameters.
A substitution box (S-box) in a symmetric primitive is a mapping $F$ that takes $k$ binary inputs and whose image is a binary $m$-tuple for some positive integers $k$ and $m$, which is usually the only nonlinear element of the most modern…
We present three simple and efficient protocol constructions to solve Yao's Millionaire Problem when the parties involved are non-colluding and semi-honest. The first construction uses a partially homomorphic Encryption Scheme and is a…
This paper presents fundamental algorithms for the computational theory of quadratic forms over number fields. In the first part of the paper, we present algorithms for checking if a given non-degenerate quadratic form over a fixed number…
An elementary approach is shown which derives the values of the Gauss sums over $\mathbb F_{p^r}$, $p$ odd, of a cubic character without using Davenport-Hasse's theorem. New links between Gauss sums over different field extensions are shown…
A Radial Basis Function Generated Finite-Differences (RBF-FD) inspired technique for evaluating definite integrals over the volume of the ball in three dimensions is described. Such methods are necessary in many areas of Applied…
The purpose of this paper is twofold. First, we derive theoretically, using appropriate transformation on $x_n$, the closed-form solution of the nonlinear difference equation \[ x_{n+1} = \frac{1}{\pm 1 + x_n},\qquad n\in \mathbb{N}_0. \]…
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodicity. The fact that Fourier transforms can also be used to…
Let K be the function field of a variety of dimension at least 2 over an algebraically closed field of characteristic zero. Then Hilbert's Tenth Problem for K is undecidable. This generalizes the result by Kim and Roush from 1992 that…
In this paper, we consider bounded width circuits and nondeterministic circuits in three somewhat new directions. In the first part of this paper, we mainly consider bounded width circuits. The main purpose of this part is to prove that…
In this research paper, the problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. Some results related to stable states/vectors, anti-stable states/vectors (over the…