Related papers: Bounded ACh Unification
We introduce \emph{Term Coding}, a novel framework for analysing extremal problems in discrete mathematics by encoding them as finite systems of \emph{term equations} (and, optionally, \emph{non-equality constraints}). In its basic form,…
The Homeomorphic Embedding relation has been amply used for defining termination criteria of symbolic methods for program analysis, transformation, and verification. However, homeomorphic embedding has never been investigated in the context…
Let $G=NH$ be a Lie group where $N,H$ are closed connected subgroups of $G,$ and $N$ is an exponential solvable Lie group which is normal in $G.$ Suppose furthermore that $N$ admits a unitary character $\chi_{\lambda}$ corresponding to a…
For a control Cauchy problem $$\dot x= {f}(t,x,u,v) +\sum_{\alpha=1}^m g_\alpha(x) \dot u_\alpha,\quad x(a)=\bar x, $$ on an interval $[a,b]$, we propose a notion of limit solution $x,$ verifying the following properties: i) $x$ is defined…
The permutation matrices form a subgroup of $\text{GL}_n(\mathbb{C})$ that is isomorphic to the symmetric group $S_n$. Let $r_{\mu\lambda}$ denote the multiplicity of the irreducible representation $V_\mu$ of $S_n$, corresponding to a…
Assume that $A$ is a closed linear operator defined on all of a Hilbert space $H$. Then $A$ is bounded. A new short proof of this classical theorem is given on the basis of the uniform boundedness principle. The proof can be easily extended…
We present a Bounded Model Checking technique for higher-order programs. The vehicle of our study is a higher-order calculus with general references. Our technique is a symbolic state syntactical translation based on SMT solvers, adapted to…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
Since Cocke and Minsky proved 2-tag systems universal, they have been extensively used to prove the universality of numerous computational models. Unfortunately, all known algorithms give universal 2-tag systems that have a large number of…
We consider the existence and uniqueness of bounded solutions of periodic evolution equations of the form $u'=A(t)u+\epsilon H(t,u)+f(t)$, where $A(t)$ is, in general, an unbounded operator depending 1-periodically on $t$, $H$ is 1-periodic…
By a new method derived from Nicola--Primo--Tabacco[24], we study the boundedness on $\alpha$-modulation spaces of unimodular multipliers with symbol $e^{i\mu(\xi)}$. Comparing with the previous results, the boundedness result is…
Chaotic iterations, a tool formerly used in distributed computing, has recently revealed various interesting properties of disorder leading to its use in the computer science security field. In this paper, a comprehensive study of its…
The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…
The Unitary Synthesis Problem (Aaronson-Kuperberg 2007) asks whether any $n$-qubit unitary $U$ can be implemented by an efficient quantum algorithm $A$ augmented with an oracle that computes an arbitrary Boolean function $f$. In other…
The maximum labelled clique problem is a variant of the maximum clique problem where edges in the graph are given labels, and we are not allowed to use more than a certain number of distinct labels in a solution. We introduce a new…
In a variety of studies of dynamical systems, the edge of order and chaos has been singled out as a region of complexity. It was suggested by Wolfram, on the basis of qualitative behaviour of cellular automata, that the computational basis…
Problem for the first order differential equation with an unbounded operator coefficient in Banach space and nonlinear nonlocal condition is considered. A numerical method is proposed and justified for the solution of this problem under…
The Diophantine Equation Hard Problem (DEHP) is a potential cryptographic problem on the Diophantine equation $U=\sum \limits_{i=1}^n {V_i x_{i}}$. A proper implementation of DEHP would render an attacker to search for private parameters…
We provide an optimization-based argument for the monotonicity of the multiplicative algorithm (MA) for a class of optimal experimental design problems considered in Yu (2010). Our proof avoids introducing auxiliary variables (or problems)…
In previous paper I construct an approximative solution of the power series expansion in closed forms of Grand Confluent Hypergeometric (GCH) function only up to one term of A_n's [4]. And I obtain normalized constant and orthogonal…