Related papers: A New Approach to Constructing Quadratic Pseudo-Pl…
In this paper, we propose some new semidefinite relaxations for a class of nonconvex complex quadratic programming problems, which widely appear in the areas of signal processing and power system. By deriving new valid constraints to the…
We give a method to construct pseudo-trace functions for vertex operator algebras satisfying Zhu's finiteness condition not through higher Zhu's algebras and apply our method to the Z_2-orbifold model associated with d-pairs of symplectic…
Let $\mathbb{F}_{p^m}$ be a finite field with $p^m$ elements, where $p$ is an odd prime and $m$ is a positive integer. Recently, \cite{Hengar} and \cite{Wang2020} determined the weight distributions of subfield codes with the form…
We study planted problems---finding hidden structures in random noisy inputs---through the lens of the sum-of-squares semidefinite programming hierarchy (SoS). This family of powerful semidefinite programs has recently yielded many new…
Enumerating the extremal submodular functions defined on subsets of a fixed base set has only been done for base sets up to five elements. This paper reports the results of attempting to generate all such functions on a six-element base…
This work presents an initial analysis of using bijective mappings to extend the Theory of Functional Connections to non-rectangular two-dimensional domains. Specifically, this manuscript proposes three different mappings techniques: a)…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
We consider pseudodifferential operators on functions on $\R^{n+1}$ which commute with the Euler operator, and can thus be restricted to spaces of functions homogeneous of some given degree. Their symbols can be regarded as functions on a…
Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group $(\gf(2^{2m}), +)$, have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective…
A linear code is said to be self-orthogonal if it is contained in its dual. Self-orthogonal codes are of interest because of their important applications, such as for constructing linear complementary dual (LCD) codes and quantum codes. In…
In this paper, we introduce a new class of nonsmooth convex functions called SOS-convex semialgebraic functions extending the recently proposed notion of SOS-convex polynomials. This class of nonsmooth convex functions covers many common…
Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…
This thesis discusses the young fields of quantum pseudo-randomness and quantum learning algorithms. We present techniques for derandomising algorithms to decrease randomness resource requirements and improve efficiency. One key object in…
Traditionally, there are several polynomial algorithms for linear programming including the ellipsoid method, the interior point method and other variants. Recently, Chubanov [Chubanov, 2015] proposed a projection and rescaling algorithm,…
Non-linear polynomial systems over finite fields are used to model functional behavior of cryptosystems, with applications in system security, computer cryptography, and post-quantum cryptography. Solving polynomial systems is also one of…
In this article, a novel method to compute all discrete polyharmonic functions in the quarter plane for models with small steps, zero drift and a finite group is proposed. A similar method is then introduced for continuous polyharmonic…
We discover a simple construction of a four-dimensional family of smooth surfaces of general type with $p_g(S)=q(S)=0$, $K^2_S=3$ with cyclic fundamental group $C_{14}$. We use a degeneration of the surfaces in this family to find…
The $2$-to-$1$ mapping over finite fields has a wide range of applications, including combinatorial mathematics and coding theory. Thus, constructions of $2$-to-$1$ mappings have attracted considerable attention recently. Based on…
For one-dimensional Schroedinger operators with complex-valued potentials, we construct pseudomodes corresponding to large pseudoeigenvalues. Our (non-semi-classical) approach results in substantial progress in achieving optimal conditions…
Let $\Delta =\{ \delta_1,\delta_2,...,\delta_m \} $ be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function $D_{\Delta }(z,u_1,u_2,...,u_m),$ which counts polygon dissections and marks…