We show weak-strong uniqueness and stability results for the motion of a two or three dimensional fluid governed by the Navier-Stokes equation interacting with a flexible, elastic plate of Koiter type. The plate is situated at the top of the fluid and as such determines the variable part of a time changing domain (that is hence a part of the solution) containing the fluid. The uniqueness result is a consequence of a stability estimate where the difference of two solutions is estimated by the distance of the initial values and outer forces. For that we introduce a methodology that overcomes the problem that the two (variable in time) domains of the fluid velocities and pressures are not the same. The estimate holds under the assumption that one of the two weak solutions possesses some additional higher regularity. The additional regularity is exclusively requested for the velocity of one of the solutions resembling the celebrated Ladyzhenskaya-Prodi-Serrin conditions in the framework of variable domains.

In this work we consider the initial-value problem associated with a coupled system of generalized Korteweg-de Vries equations. We present a relationship between the best constant for a Gagliardo-Nirenberg type inequality and a criterion for the existence of global solutions in the energy space. We prove that such a constant is directly related to the existence problem of solitary-wave solutions with minimal mass, the so called ground state solutions. To guarantee the existence of ground states we use a variational method.

We investigate quasistatic evolution in finite plasticity under the assumption that the plastic strain is compatible. This assumption is well-suited to describe the special case of dislocation-free plasticity and entails that the plastic strain is the gradient of a plastic deformation map. The total deformation can be then seen as the composition of a plastic and an elastic deformation. This opens the way to an existence theory for the quasistatic evolution problem featuring both Lagrangian and Eulerian variables. A remarkable trait of the result is that it does not require second-order gradients.

We study a mean field approximation for the 2D Euler vorticity equation driven by a transport noise. We prove that the Euler equations can be approximated by interacting point vortices driven by a regularized Biot-Savart kernel and the same common noise. The approximation happens by sending the number of particles $N$ to infinity and the regularization $epsilon$ in the Biot-Savart kernel to $0$, as a suitable function of $N$.

We examine Chern-Simons theory as a deformation of a 3-dimensional BF theory that is partially holomorphic and partially topological. In particular, we introduce a novel gauge that leads naturally to a one-loop exact quantization of this BF theory and Chern-Simons theory. This approach illuminates several important features of Chern-Simons theory, notably the bulk-boundary correspondence of Chern-Simons theory with chiral WZW theory. In addition to rigorously constructing the theory, we also explain how it applies to a large class of closely related 3-dimensional theories and some of the consequences for factorization algebras of observables.

In this paper we consider the "quasidensity" of a subset of the product of a Banach space and its dual, and give a connection between quasidense sets and sets of "type (NI)". We discuss "coincidence sets" of certain convex functions and prove two sum theorems for coincidence sets. We obtain new results on the Fitzpatrick extension of a closed quasidense monotone multifunction. The analysis in this paper is self-contained, and independent of previous work on "Banach SN spaces". This version differs from the previous version because it is shown that the (well known) equivalence of quasidensity and "type (NI)" for maximally monotone sets is not true without the monotonicity assumption and that the appendix has been moved to the end of Section 10, where it rightfully belongs.

The central aim of this paper is to study (regional) fractional Poincar'e type inequalities on unbounded domains satisfying the finite ball condition. Both existence and non existence type results are established depending on various conditions on domains and on the range of $s in (0,1)$. The best constant in both regional fractional and fractional Poincar'e inequality is characterized for strip like domains $(omega imes mathbb{R}^{n-1})$, and the results obtained in this direction are analogous to those of the local case. This settles one of the natural questions raised by K. Yeressian in [ extit{Asymptotic behavior of elliptic nonlocal equations set in cylinders, Asymptot. Anal. 89, (2014), no 1-2}].

We prove that, given a constant $K> 2$ and a bounded linear operator $T$ from a JB$^*$-triple $E$ into a complex Hilbert space $H$, there exists a norm-one functional $psiin E^*$ satisfying $$|T(x)| leq K , |T| , |x|_{psi},$$ for all $xin E$. Applying this result we show that, given $G > 8 (1+2sqrt{3})$ and a bounded bilinear form $V$ on the Cartesian product of two JB$^*$-triples $E$ and $B$, there exist norm-one functionals $varphiin E^{*}$ and $psiin B^{*}$ satisfying $$|V(x,y)| leq G |V| , |x|_{varphi} , |y|_{psi}$$ for all $(x,y)in E imes B$. These results prove a conjecture pursued during almost twenty years.

We deal with various Diophantine equations involving the Euler totient function and various sequences of numbers, including factorials, powers, and Fibonacci sequences.

We consider the stochastic 2-dimensional Cahn-Hilliard equation which is driven by the derivative in space of a space-time white noise. We use two different approaches to study this equation. First we prove that there exists a unique solution $Y$ to the shifted equation (see (1.4) below), then $X:=Y+{Z}$ is the unique solution to stochastic Cahn-Hilliard equaiton, where ${Z}$ is the corresponding O-U process. Moreover, we use Dirichlet form approach in cite{Albeverio:1991hk} to construct the probabilistically weak solution the the original equation (1.1) below. By clarifying the precise relation between the solutions obtained by the Dirichlet forms aprroach and $X$, we can also get the restricted Markov uniquness of the generator and the uniqueness of martingale solutions to the equation (1.1).

In this paper, we are concerned with the numerical solution of one type integro-differential equation by a probability method based on the fundamental martingale of mixed Gaussian processes. As an application, we will try to simulate the estimation of ruin probability with an unknown parameter driven not by the classical L'evy process but by the mixed fractional Brownian motion.

We study a class of fourth order nonlinear parabolic equations which include the thin-film equation and the quantum drift-diffusion model as special cases. We investigate these equations by first developing functional inequalities of the type $ int_Omega u^{2gamma-alpha-eta}Delta u^alphaDelta u^eta dx geq cint_Omega|Delta u^gamma |^2dx $, which seem to be of interest on their own right.

In this review paper, we survey Hardy type inequalities from the point of view of Folland and Stein's homogeneous groups. Particular attention is paid to Hardy type inequalities on stratified groups which give a special class of homogeneous groups. In this environment, the theory of Hardy type inequalities becomes intricately intertwined with the properties of sub-Laplacians and more general subelliptic partial differential equations. Particularly, we discuss the Badiale-Tarantello conjecture and a conjecture on the geometric Hardy inequality in a half-space of the Heisenberg group with a sharp constant.

Among all dissipative solutions of the multi-dimensional isentropic Euler equations there exists at least one that minimizes the acceleration, which implies that the solution is as close to being a weak solution as possible. The argument is based on a suitable selection procedure.

Let $Isubseteq S=K[x_1,ldots,x_n]$ be a homogeneous ideal equipped with a monomial order $<$. We show that if $operatorname{in}_<(I)$ is a square-free monomial ideal, then $S/I$ and $S/operatorname{in}_<(I)$ have the same connectedness dimension. We also show that graphs related to connectedness of these quotient rings have the same number of components. We also provide consequences regarding Lyubeznik numbers. We obtain these results by furthering the study of connectedness modulo a parameter in a local ring.

We propose a general procedure to construct noncommutative deformations of an algebraic submanifold $M$ of $mathbb{R}^n$, specializing the procedure [G. Fiore, T. Weber, Twisted submanifolds of $mathbb{R}^n$, arXiv:2003.03854] valid for smooth submanifolds. We use the framework of twisted differential geometry of [Aschieri et al.,Class. Quantum Gravity 23 (2006), 1883], whereby the commutative pointwise product is replaced by the $star$-product determined by a Drinfel'd twist. We actually simultaneously construct noncommutative deformations of all the algebraic submanifolds $M_c$ that are level sets of the $f^a(x)$, where $f^a(x)=0$ are the polynomial equations solved by the points of $M$, employing twists based on the Lie algebra $Xi_t$ of vector fields that are tangent to all the $M_c$. The twisted Cartan calculus is automatically equivariant under twisted $Xi_t$. If we endow $mathbb{R}^n$ with a metric, then twisting and projecting to normal or tangent components commute, projecting the Levi-Civita connection to the twisted $M$ is consistent, and in particular a twisted Gauss theorem holds, provided the twist is based on Killing vector fields. Twisted algebraic quadrics can be characterized in terms of generators and $star$-polynomial relations. We explicitly work out deformations based on abelian or Jordanian twists of all quadrics in $mathbb{R}^3$ except ellipsoids, in particular twisted cylinders embedded in twisted Euclidean $mathbb{R}^3$ and twisted hyperboloids embedded in twisted Minkowski $mathbb{R}^3$ [the latter are twisted (anti-)de Sitter spaces $dS_2,AdS_2$].

We offer an alternative proof of a result of Conlon, Fox, Sudakov and Zhao on solving translation-invariant linear equations in dense Sidon sets. Our proof generalises to equations in more than five variables and yields effective bounds.

In cite{S 2017}, Suh gave a non-existence theorem for Hopf real hypersurfaces in the complex quadric with parallel normal Jacobi operator. Motivated by this result, in this paper, we introduce some generalized conditions named $mathcal C$-parallel or Reeb parallel normal Jacobi operators. By using such weaker parallelisms of normal Jacobi operator, first we can assert a non-existence theorem of Hopf real hypersurfaces with $mathcal C$-parallel normal Jacobi operator in the complex quadric $Q^{m}$, $m geq 3$. Next, we prove that a Hopf real hypersurface has Reeb parallel normal Jacobi operator if and only if it has an $mathfrak A$-isotropic singular normal vector field.

We consider two special cases of the connection problem for the second Painlev'e equation (PII) using the method of uniform asymptotics proposed by Bassom et al.. We give a classification of the real solutions of PII on the negative (positive) real axis with respect to their initial data. By product, a rigorous proof of a property associate with the nonlinear eigenvalue problem of PII on the real axis, recently revealed by Bender and Komijani, is given by deriving the asymptotic behavior of the Stokes multipliers.

In this paper, we study the regularity criterion of weak solutions to the three-dimensional (3D) MHD equations. It is proved that the solution $(u,b)$ becomes regular provided that one velocity and one current density component of the solution satisfy% egin{equation} u_{3}in L^{frac{30alpha }{7alpha -45}}left( 0,T;L^{alpha ,infty }left( mathbb{R}^{3} ight) ight) ext{ with }frac{45}{7}% leq alpha leq infty , label{eq01} end{equation}% and egin{equation} j_{3}in L^{frac{2eta }{2eta -3}}left( 0,T;L^{eta ,infty }left( mathbb{R}^{3} ight) ight) ext{ with }frac{3}{2}leq eta leq infty , label{eq02} end{equation}% which generalize some known results.

We introduce a Gaussian measure formally preserved by the 2-dimensional Primitive Equations driven by additive Gaussian noise. Under such measure the stochastic equations under consideration are singular: we propose a solution theory based on the techniques developed by Gubinelli and Jara in cite{GuJa13} for a hyperviscous version of the equations.

We give a simple proof of the strong maximum principle for viscosity subsolutions of fully nonlinear elliptic PDEs on the form $$ F(x,u,Du,D^2u) = 0 $$ under suitable structure conditions on the equation allowing for non-Lipschitz growth in the gradient terms. In case of smooth boundaries, we also prove the Hopf lemma, the boundary Harnack inequality and that positive viscosity solutions vanishing on a portion of the boundary are comparable with the distance function near the boundary. Our results apply to weak solutions of an eigenvalue problem for the variable exponent $p$-Laplacian.

In this work, the generalized $N$-component Fokas-Lenells(FL) equations, which have been studied by Guo and Ling (2012 J. Math. Phys. 53 (7) 073506) for $N=2$, are first investigated via Riemann-Hilbert(RH) approach. The main purpose of this is to study the soliton solutions of the coupled Fokas-Lenells(FL) equations for any positive integer $N$, which have more complex linear relationship than the analogues reported before. We first analyze the spectral analysis of the Lax pair associated with a $(N+1) imes (N+1)$ matrix spectral problem for the $N$-component FL equations. Then, a kind of RH problem is successfully formulated. By introducing the special conditions of irregularity and reflectionless case, the $N$-soliton solution formula of the equations are derived through solving the corresponding RH problem. Furthermore, take $N=2,3$ and $4$ for examples, the localized structures and dynamic propagation behavior of their soliton solutions and their interactions are discussed by some graphical analysis.

In the present paper by the Fourier transform we show that every linear differential equations of $n$-th order has a solution in $L^1(Bbb{R})$ which is infinitely differentiable in $Bbb{R} setminus {0}$. Moreover the Hyers-Ulam stability of such equations on $L^1(Bbb{R})$ is investigated.

Our goal in this article is to study the global Lorentz estimates for gradient of weak solutions to $p$-Laplace double obstacle problems involving the Schr"odinger term: $-Delta_p u + mathbb{V}|u|^{p-2}u$ with bound constraints $psi_1 le u le psi_2$ in non-smooth domains. This problem has its own interest in mathematics, engineering, physics and other branches of science. Our approach makes a novel connection between the study of Calder'on-Zygmund theory for nonlinear Schr"odinger type equations and variational inequalities for double obstacle problems.

In information theory, the so-called log-sum inequality is fundamental and a kind of generalization of the non-nagativity for the relative entropy. In this paper, we show the generalized log-sum inequality for two functions defined for scalars. We also give a new result for commutative matrices. In addition, we demonstrate further results for general non-commutative positive semi-definite matrices.

We investigate the quantum twistor bundle constructed as a $U(1)$-quotient of the quantum instanton bundle of Bonechi, Ciccoli and Tarlini. It is an example of a locally trivial noncommutative bundle fulfilling conditions of the framework recently proposed by Brzezi'nski and Szyma'nski. In particular, we give a detailed description of the corresponding $C^*$-algebra of 'continuous functions' on its noncommutative total space. Furthermore, we analyse a different construction of a quantum instanton bundle due to Landi, Pagani and Reina, find a basis of its polynomial algebra and discover an intriguing and unexpected feature of its enveloping $C^*$-algebra.

The problem of minimizing an entropy functional subject to linear constraints is a useful example of partially finite convex programming. In the 1990s, Borwein and Lewis provided broad and easy-to-verify conditions that guarantee strong duality for such problems. Their approach is to construct a function in the quasi-relative interior of the relevant infinite-dimensional set, which assures the existence of a point in the core of the relevant finite-dimensional set. We revisit this problem, and provide an alternative proof by directly appealing to the definition of the core, rather than by relying on any properties of the quasi-relative interior. Our approach admits a minor relaxation of the linear independence requirements in Borwein and Lewis' framework, which allows us to work with certain piecewise-defined moment functions precluded by their conditions. We provide such a computed example that illustrates how this relaxation may be used to tame observed Gibbs phenomenon when the underlying data is discontinuous. The relaxation illustrates the understanding we may gain by tackling partially-finite problems from both the finite-dimensional and infinite-dimensional sides. The comparison of these two approaches is informative, as both proofs are constructive.

We study the two-parameter quadratic sieve for a general test function. We prove, under some very general assumptions, that the function considered by Barban and Vehov [BV68] and Graham [Gra78] for this problem is optimal up to the second-order term. We determine that second-order term explicitly.

We study SLE$_{kappa}$ theory with elements of Quasi-Sure Stochastic Analysis through Aggregation. Specifically, we show how the latter can be used to construct the SLE$_{kappa}$ traces quasi-surely (i.e. simultaneously for a family of probability measures with certain properties) for $kappa in mathcal{K}cap mathbb{R}_+ setminus ([0, epsilon) cup {8})$, for any $epsilon>0$ with $mathcal{K} subset mathbb{R}_{+}$ a nontrivial compact interval, i.e. for all $kappa$ that are not in a neighborhood of zero and are different from $8$. As a by-product of the analysis, we show in this language a version of the continuity in $kappa$ of the SLE$_{kappa}$ traces for all $kappa$ in compact intervals as above.

The paper proposes a polynomial formula for solution quadratic congruences in $mathbb{Z}_p$. This formula gives the correct answer for quadratic residue and zeroes for quadratic nonresidue. The general form of the formula for $p=3 ; m{mod},4$, $p=5 ; m{mod},8$ and for $p=9 ; m{mod},16$ are suggested.

We present the correspondence between Lax integrable systems with spectral parameter on a Riemann surface, and Conformal Field Theories, in quite general set-up suggested earlier by the author. This correspondence turns out to give a prequantization of the integrable systems in question.

Quantum computing has evolved quickly in recent years and is showing significant benefits in a variety of fields. Malware analysis is one of those fields that could also take advantage of quantum computing. The combination of software used to locate the most frequent hashes and $n$-grams between benign and malicious software (KiloGram) and a quantum search algorithm could be beneficial, by loading the table of hashes and $n$-grams into a quantum computer, and thereby speeding up the process of mapping $n$-grams to their hashes. The first phase will be to use KiloGram to find the top-$k$ hashes and $n$-grams for a large malware corpus. From here, the resulting hash table is then loaded into a quantum machine. A quantum search algorithm is then used search among every permutation of the entangled key and value pairs to find the desired hash value. This prevents one from having to re-compute hashes for a set of $n$-grams, which can take on average $O(MN)$ time, whereas the quantum algorithm could take $O(sqrt{N})$ in the number of table lookups to find the desired hash values.

The quantum Fourier transform brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are examined. The capabilities of QFT-based addition and multiplication are improved with some modifications. The proposed operations are compared with the nearest quantum arithmetic operations. Furthermore, novel QFT-based subtraction and division operations are presented. The proposed arithmetic operations can perform non-modular operations on all signed numbers without any limitation by using less resources. In addition, novel quantum circuits of two's complement, absolute value and comparison operations are also presented by using the proposed QFT based addition and subtraction operations.

Many efforts of research are devoted to semantic role labeling (SRL) which is crucial for natural language understanding. Supervised approaches have achieved impressing performances when large-scale corpora are available for resource-rich languages such as English. While for the low-resource languages with no annotated SRL dataset, it is still challenging to obtain competitive performances. Cross-lingual SRL is one promising way to address the problem, which has achieved great advances with the help of model transferring and annotation projection. In this paper, we propose a novel alternative based on corpus translation, constructing high-quality training datasets for the target languages from the source gold-standard SRL annotations. Experimental results on Universal Proposition Bank show that the translation-based method is highly effective, and the automatic pseudo datasets can improve the target-language SRL performances significantly.

Noisy Intermediate-Scale Quantum (NISQ) computers are entering an era in which they can perform computational tasks beyond the capabilities of the most powerful classical computers, thereby achieving "Quantum Supremacy", a major milestone in quantum computing. NISQ Supremacy requires comparison with a state-of-the-art classical simulator. We report HPC simulations of hard random quantum circuits (RQC), which have been recently used as a benchmark for the first experimental demonstration of Quantum Supremacy, sustaining an average performance of 281 Pflop/s (true single precision) on Summit, currently the fastest supercomputer in the World. These simulations were carried out using qFlex, a tensor-network-based classical high-performance simulator of RQCs. Our results show an advantage of many orders of magnitude in energy consumption of NISQ devices over classical supercomputers. In addition, we propose a standard benchmark for NISQ computers based on qFlex.

The problem of sampling from the stationary distribution of a Markov chain finds widespread applications in a variety of fields. The time required for a Markov chain to converge to its stationary distribution is known as the classical mixing time. In this article, we deal with analog quantum algorithms for mixing. First, we provide an analog quantum algorithm that given a Markov chain, allows us to sample from its stationary distribution in a time that scales as the sum of the square root of the classical mixing time and the square root of the classical hitting time. Our algorithm makes use of the framework of interpolated quantum walks and relies on Hamiltonian evolution in conjunction with von Neumann measurements.

There also exists a different notion for quantum mixing: the problem of sampling from the limiting distribution of quantum walks, defined in a time-averaged sense. In this scenario, the quantum mixing time is defined as the time required to sample from a distribution that is close to this limiting distribution. Recently we provided an upper bound on the quantum mixing time for Erd"os-Renyi random graphs [Phys. Rev. Lett. 124, 050501 (2020)]. Here, we also extend and expand upon our findings therein. Namely, we provide an intuitive understanding of the state-of-the-art random matrix theory tools used to derive our results. In particular, for our analysis we require information about macroscopic, mesoscopic and microscopic statistics of eigenvalues of random matrices which we highlight here. Furthermore, we provide numerical simulations that corroborate our analytical findings and extend this notion of mixing from simple graphs to any ergodic, reversible, Markov chain.

This work deals with the efficient numerical solution of the time-fractional heat equation discretized on non-uniform temporal meshes. Non-uniform grids are essential to capture the singularities of "typical" solutions of time-fractional problems. We propose an efficient space-time multigrid method based on the waveform relaxation technique, which accounts for the nonlocal character of the fractional differential operator. To maintain an optimal complexity, which can be obtained for the case of uniform grids, we approximate the coefficient matrix corresponding to the temporal discretization by its hierarchical matrix (${cal H}$-matrix) representation. In particular, the proposed method has a computational cost of ${cal O}(k N M log(M))$, where $M$ is the number of time steps, $N$ is the number of spatial grid points, and $k$ is a parameter which controls the accuracy of the ${cal H}$-matrix approximation. The efficiency and the good convergence of the algorithm, which can be theoretically justified by a semi-algebraic mode analysis, are demonstrated through numerical experiments in both one- and two-dimensional spaces.

We introduce $Psimathrm{ec}$, a local spectral exterior calculus for the two-sphere $S^2$. $Psimathrm{ec}$ provides a discretization of Cartan's exterior calculus on $S^2$ formed by spherical differential $r$-form wavelets. These are well localized in space and frequency and provide (Stevenson) frames for the homogeneous Sobolev spaces $dot{H}^{-r+1}( Omega_{ u}^{r} , S^2 )$ of differential $r$-forms. At the same time, they satisfy important properties of the exterior calculus, such as the de Rahm complex and the Hodge-Helmholtz decomposition. Through this, $Psimathrm{ec}$ is tailored towards structure preserving discretizations that can adapt to solutions with varying regularity. The construction of $Psimathrm{ec}$ is based on a novel spherical wavelet frame for $L_2(S^2)$ that we obtain by introducing scalable reproducing kernel frames. These extend scalable frames to weighted sampling expansions and provide an alternative to quadrature rules for the discretization of needlet-like scale-discrete wavelets. We verify the practicality of $Psimathrm{ec}$ for numerical computations using the rotating shallow water equations. Our numerical results demonstrate that a $Psimathrm{ec}$-based discretization of the equations attains accuracy comparable to those of spectral methods while using a representation that is well localized in space and frequency.

We present a sound and complete method for the verification of qualitative liveness properties of replicated systems under stochastic scheduling. These are systems consisting of a finite-state program, executed by an unknown number of indistinguishable agents, where the next agent to make a move is determined by the result of a random experiment. We show that if a property of such a system holds, then there is always a witness in the shape of a Presburger stage graph: a finite graph whose nodes are Presburger-definable sets of configurations. Due to the high complexity of the verification problem (non-elementary), we introduce an incomplete procedure for the construction of Presburger stage graphs, and implement it on top of an SMT solver. The procedure makes extensive use of the theory of well-quasi-orders, and of the structural theory of Petri nets and vector addition systems. We apply our results to a set of benchmarks, in particular to a large collection of population protocols, a model of distributed computation extensively studied by the distributed computing community.

Sentence level quality estimation (QE) for machine translation (MT) attempts to predict the translation edit rate (TER) cost of post-editing work required to correct MT output. We describe our view on sentence-level QE as dictated by several practical setups encountered in the industry. We find consumers of MT output---whether human or algorithmic ones---to be primarily interested in a binary quality metric: is the translated sentence adequate as-is or does it need post-editing? Motivated by this we propose a quality classification (QC) view on sentence-level QE whereby we focus on maximizing recall at precision above a given threshold. We demonstrate that, while classical QE regression models fare poorly on this task, they can be re-purposed by replacing the output regression layer with a binary classification one, achieving 50-60\% recall at 90\% precision. For a high-quality MT system producing 75-80\% correct translations, this promises a significant reduction in post-editing work indeed.

Quantum dialogue is a process of two way secure and simultaneous communication using a single channel. Recently, a Measurement Device Independent Quantum Dialogue (MDI-QD) protocol has been proposed (Quantum Information Processing 16.12 (2017): 305). To make the protocol secure against information leakage, the authors have discarded almost half of the qubits remaining after the error estimation phase. In this paper, we propose two modified versions of the MDI-QD protocol such that the number of discarded qubits is reduced to almost one-fourth of the remaining qubits after the error estimation phase. We use almost half of their discarded qubits along with their used qubits to make our protocol more efficient in qubits count. We show that both of our protocols are secure under the same adversarial model given in MDI-QD protocol.

For any finite Galois field extension $mathsf{K}/mathsf{F}$, with Galois group $G = mathrm{Gal}(mathsf{K}/mathsf{F})$, there exists an element $alpha in mathsf{K}$ whose orbit $Gcdotalpha$ forms an $mathsf{F}$-basis of $mathsf{K}$. Such an $alpha$ is called a normal element and $Gcdotalpha$ is a normal basis. We introduce a probabilistic algorithm for testing whether a given $alpha in mathsf{K}$ is normal, when $G$ is either a finite abelian or a metacyclic group. The algorithm is based on the fact that deciding whether $alpha$ is normal can be reduced to deciding whether $sum_{g in G} g(alpha)g in mathsf{K}[G]$ is invertible; it requires a slightly subquadratic number of operations. Once we know that $alpha$ is normal, we show how to perform conversions between the working basis of $mathsf{K}/mathsf{F}$ and the normal basis with the same asymptotic cost.

Correlation alignment (CORAL), a representative domain adaptation (DA) algorithm, decorrelates and aligns a labelled source domain dataset to an unlabelled target domain dataset to minimize the domain shift such that a classifier can be applied to predict the target domain labels. In this paper, we implement the CORAL on quantum devices by two different methods. One method utilizes quantum basic linear algebra subroutines (QBLAS) to implement the CORAL with exponential speedup in the number and dimension of the given data samples. The other method is achieved through a variational hybrid quantum-classical procedure. In addition, the numerical experiments of the CORAL with three different types of data sets, namely the synthetic data, the synthetic-Iris data, the handwritten digit data, are presented to evaluate the performance of our work. The simulation results prove that the variational quantum correlation alignment algorithm (VQCORAL) can achieve competitive performance compared with the classical CORAL.

A proof of convergence is given for bulk--surface finite element semi-discretisation of the Cahn--Hilliard equation with Cahn--Hilliard-type dynamic boundary conditions in a smooth domain. The semi-discretisation is studied in the weak formulation as a second order system. Optimal-order uniform-in-time error estimates are shown in the $L^2$ and $H^1$ norms. The error estimates are based on a consistency and stability analysis. The proof of stability is performed in an abstract framework, based on energy estimates exploiting the anti-symmetric structure of the second order system. Numerical experiments illustrate the theoretical results.

In this paper, some useful necessary and sufficient conditions for the unique solution of the generalized absolute value equation (GAVE) $Ax-B|x|=b$ with $A, Bin mathbb{R}^{n imes n}$ from the optimization field are first presented, which cover the fundamental theorem for the unique solution of the linear system $Ax=b$ with $Ain mathbb{R}^{n imes n}$. Not only that, some new sufficient conditions for the unique solution of the GAVE are obtained, which are weaker than the previous published works.

High-order entropy-stable discontinuous Galerkin (DG) methods for nonlinear conservation laws reproduce a discrete entropy inequality by combining entropy conservative finite volume fluxes with summation-by-parts (SBP) discretization matrices. In the DG context, on tensor product (quadrilateral and hexahedral) elements, SBP matrices are typically constructed by collocating at Lobatto quadrature points. Recent work has extended the construction of entropy-stable DG schemes to collocation at more accurate Gauss quadrature points.

In this work, we extend entropy-stable Gauss collocation schemes to non-conforming meshes. Entropy-stable DG schemes require computing entropy conservative numerical fluxes between volume and surface quadrature nodes. On conforming tensor product meshes where volume and surface nodes are aligned, flux evaluations are required only between "lines" of nodes. However, on non-conforming meshes, volume and surface nodes are no longer aligned, resulting in a larger number of flux evaluations. We reduce this expense by introducing an entropy-stable mortar-based treatment of non-conforming interfaces via a face-local correction term, and provide necessary conditions for high-order accuracy. Numerical experiments in both two and three dimensions confirm the stability and accuracy of this approach.

Public key encryption with equality test (PKEET) allows testing whether two ciphertexts are generated by the same message or not. PKEET is a potential candidate for many practical applications like efficient data management on encrypted databases. Potential applicability of PKEET leads to intensive research from its first instantiation by Yang et al. (CT-RSA 2010). Most of the followup constructions are secure in the random oracle model. Moreover, the security of all the concrete constructions is based on number-theoretic hardness assumptions which are vulnerable in the post-quantum era. Recently, Lee et al. (ePrint 2016) proposed a generic construction of PKEET schemes in the standard model and hence it is possible to yield the first instantiation of PKEET schemes based on lattices. Their method is to use a $2$-level hierarchical identity-based encryption (HIBE) scheme together with a one-time signature scheme. In this paper, we propose, for the first time, a direct construction of a PKEET scheme based on the hardness assumption of lattices in the standard model. More specifically, the security of the proposed scheme is reduces to the hardness of the Learning With Errors problem.

We propose some new mixed finite element methods for the time dependent stochastic Stokes equations with multiplicative noise, which use the Helmholtz decomposition of the driving multiplicative noise. It is known [16] that the pressure solution has a low regularity, which manifests in sub-optimal convergence rates for well-known inf-sup stable mixed finite element methods in numerical simulations, see [10]. We show that eliminating this gradient part from the noise in the numerical scheme leads to optimally convergent mixed finite element methods, and that this conceptual idea may be used to retool numerical methods that are well-known in the deterministic setting, including pressure stabilization methods, so that their optimal convergence properties can still be maintained in the stochastic setting. Computational experiments are also provided to validate the theoretical results and to illustrate the conceptional usefulness of the proposed numerical approach.

In this technical report we give an elementary introduction to Quantum Computing for non-physicists. In this introduction we describe in detail some of the foundational Quantum Algorithms including: the Deutsch-Jozsa Algorithm, Shor's Algorithm, Grocer Search, and Quantum Counting Algorithm and briefly the Harrow-Lloyd Algorithm. Additionally we give an introduction to Solomonoff Induction, a theoretically optimal method for prediction. We then attempt to use Quantum computing to find better algorithms for the approximation of Solomonoff Induction. This is done by using techniques from other Quantum computing algorithms to achieve a speedup in computing the speed prior, which is an approximation of Solomonoff's prior, a key part of Solomonoff Induction. The major limiting factors are that the probabilities being computed are often so small that without a sufficient (often large) amount of trials, the error may be larger than the result. If a substantial speedup in the computation of an approximation of Solomonoff Induction can be achieved through quantum computing, then this can be applied to the field of intelligent agents as a key part of an approximation of the agent AIXI.