Related papers: New results on quasi-subfield polynomials
We present a polynomial-time quantum algorithm for the Hidden Subgroup Problem over $\mathbb{D}_{2^n}$. The usual approach to the Hidden Subgroup Problem relies on harmonic analysis in the domain of the problem, and the best known algorithm…
In this paper we define a family of theories, quasi-theories, motivated by quasi-elliptic cohomology. They can be defined from constant loop spaces. With them, the constructions on certain theories can be made in a neat way, such as those…
We construct least squares formulations of PDEs with inhomogeneous essential boundary conditions, where boundary residuals are not measured in unpractical fractional Sobolev norms, but which formulations nevertheless are shown to yield a…
The semidirect discrete logarithm problem (SDLP) in finite groups was proposed as a foundation for post-quantum cryptographic protocols, based on the belief that its non-abelian structure would resist quantum attacks. However, recent…
In this paper, we generalize the definition of sub-slope, introduced by Guo-Song, to almost Hermitian manifolds and prove the existence of solutions for a general class of fully non-linear equations on compact almost Hermitian manifolds. As…
In this thesis, we consider semi-algebraic sets over a real closed field $R$ defined by quadratic polynomials. Semi-algebraic sets of $R^k$ are defined as the smallest family of sets in $R^k$ that contains the algebraic sets as well as the…
Finite linear least squares is one of the core problems of numerical linear algebra, with countless applications across science and engineering. Consequently, there is a rich and ongoing literature on algorithms for solving linear least…
Biedl et al. introduced the minimum ply cover problem in CG 2021 following the seminal work of Erlebach and van Leeuwen in SODA 2008. They showed that determining the minimum ply cover number for a given set of points by a given set of…
In this paper, we propose a novel machine learning method based on an adaptive tensor neural network subspace for solving quasiperiodic elliptic problems. To this end, we first provide a theoretical analysis of the associated quasiperiodic…
We present a new method for solving the hidden polynomial graph problem (HPGP) which is a special case of the hidden polynomial problem (HPP). The new approach yields an efficient quantum algorithm for the bivariate HPGP even when the input…
In a recent paper, Kuperberg described the first subexponential time algorithm for solving the dihedral hidden subgroup problem. The space requirement of his algorithm is super-polynomial. We describe a modified algorithm whose running time…
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…
We introduce a series of $\Z_2^n$-graded quasialgebras $\bbP_n(m)$ which generalizes Clifford algebras, higher octonions, and higher Cayley algebras. The constructed series of algebras and their minor perturbations are applied to contribute…
In recent algorithms that use deformation in order to compute the number of points on varieties over a finite field, certain differential equations of matrices over p-adic fields emerge. We present a novel strategy to solve this kind of…
We introduce an explicit family of representations of the double affine Hecke algebra $\mathbb{H}$ acting on spaces of quasi-polynomials, defined in terms of truncated Demazure-Lusztig type operators. We show that these quasi-polynomial…
This paper introduces an elliptic quasi-variational inequality (QVI) problem class with fractional diffusion of order $s \in (0,1)$, studies existence and uniqueness of solutions and develops a solution algorithm. As the fractional…
Quasi-equilibrium approximation is a widely used closure approximation approach for model reduction with applications in complex fluids, materials science, etc. It is based on the maximum entropy principle and leads to thermodynamically…
In this paper, we begin by reviewing some of the known properties of QQR codes and proved that $PSL_2(p)$ acts on the extended QQR code when $p \equiv 3 \pmod 4$. Using this discovery, we then showed their weight polynomials satisfy a…
The problem of solving tropical linear systems, a natural problem of tropical mathematics, has already proven to be very interesting from the algorithmic point of view: it is known to be in $NP\cap coNP$ but no polynomial time algorithm is…
Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a $d$-dimensional system…