Related papers: The Lambek-Grishin calculus is NP-complete
The syntactic calculus of Lambek is a deductive system for the multiplicative fragment of intuitionistic non-commutative linear logic. As a fine-grained calculus of resources, it has many applications, mostly in formal computational…
This work studies discontinuous Galerkin (DG) approximations of the boundary value problem for homogeneous transversely isotropic linear elastic bodies. Low-order approximations on triangles are adopted, with the use of three interior…
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.
We prove that any rational linear combination of Pontryagin numbers that is not a multiple of the signature is unbounded on connected closed oriented manifolds of nonnegative sectional curvature. Combining our result with Gromov's…
Generalized Discrete Logarithm Problem (GDLP) is an extension of the Discrete Logarithm Problem where the goal is to find $x\in\mathbb{Z}_s$ such $g^x\mod s=y$ for a given $g,y\in\mathbb{Z}_s$. Generalized discrete logarithm is similar but…
In this paper we study the graded version of Naimark's problem for Leavitt path algebras considering them as $\mathbb{Z}$-graded algebras. Several characterizations are obtained of a Leavitt path algebra $L$ of an arbitrary graph $E$ over a…
The present paper is dedicated to integrable models with Mikhailov reduction groups $G_R \simeq \mathbb{D}_h.$ Their Lax representation allows us to prove, that their solution is equivalent to solving Riemann-Hilbert problems, whose…
A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…
We prove the functional equation of the non archimedean exterior-square L-function of irreducible representations of GL(n), when n is odd.
By the recursion operator of the Kaup-Newell hierarchy we construct the relativistic derivative NLS (RDNLS) equation and the corresponding Lax pair. In the nonrelativistic limit $c \rightarrow \infty$ it reduces to DNLS equation and…
We develop a pseudo-differential approach to the N=2 supersymmetric unconstrained matrix (k|n,m)-Generalized Nonlinear Schroedinger hierarchies and prove consistency of the corresponding Lax-pair representation (nlin.SI/0201026).…
Based on previous work we consturct an equation (Lagrange equation) and relate it with a system of generalized integrals and differential equations in such a way to provide useful evaluations and connections between them.
A non-isospectral linear problem for an integrable 2+1 generalization of the non linear Schr\"odinger equation, which includes dispersive terms of third and fourth order, is presented. The classical symmetries of the Lax pair and the…
We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…
The aim of this article is to discuss the $n$-derivation algebras of Lie color algebras. It is proved that, if the base ring contains $\frac{1}{n-1}$, $L$ is a perfect Lie color algebra with zero center, then every triple derivation of $L$…
We show entireness of complete adjoint L-functions associated to \textbf{any} cuspidal representations of $\GL(3)$ or $\GL(4)$ over an arbitrary global field. Twisted cases are also investigated.
We expand a discrete--time lattice sine--Gordon equation on multiple lattices and obtain the partial difference equation which governs its far field behaviour. Such reduction allow us to obtain a new completely discrete nonlinear…
We propose some nonlinear Schr\"{o}dinger equations by adding some higher order terms to the Lagrangian density of Schr\"{o}dinger field, and obtain the Gross-Pitaevskii (GP) equation and the logarithmic form equation naturally. In…
We study a certain class of non-maximal rank contractions of the nilpotent Lie algebra $\frak{g}_{m}$ and show that these contractions are completable Lie algebras. As a consequence a family of solvable complete Lie algebras of non-maximal…
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an…