Related papers: New Combinatorial Complete One-Way Functions

A pairing function for the non-negative integers is said to be binary perfect if the binary representation of the output is of length 2k or less whenever each input has length k or less. Pairing functions with square shells, such as the…

Following the recent work [13] fulfilled in the discrete case, we pro- vide in this paper new intertwining relations for semigroups of one-dimensional diffusions. Various applications of these results are investigated, among them the famous…

By adapting Salomaa's complete proof system for equality of regular expressions under the language semantics, Milner (1984) formulated a sound proof system for bisimilarity of regular expressions under the process interpretation he…

In this article, we consider systems of linear congruences in several variables and obtain necessary and sufficient conditions as well as explicit expressions for the number of solutions subject to certain restriction conditions. These…

In [1], an operator was introduced which acts parallel to the Riemann-Liouville differintegral on a transformation of the space of real analytic functions and commutes with itself. This paper aims to extend the technique - and its defining…

We show the functional completeness for the connectives of the non-trivial negation inconsistent logic C by using a well-established method implementing purely proof-theoretic notions only. Firstly, given that C contains a strong negation,…

We present the stellar resolution, a "flexible" tile system based on Robinson's first-order resolution. After establishing formal definitions and basic properties of the stellar resolution, we show its Turing-completeness and to illustrate…

This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a…

We propose and develop a novel framework for analyzing permutation-based combinatorial optimization problems, which could eventually be extended to other types of problems. Our approach is based on the decomposition of the objective…

A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and…

In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…

Let K(X) be the collection of all non-zero finite dimensional subspaces of rational functions on an n-dimensional irreducible variety X. For any n-tuple L_1,..., L_n in K(X), we define an intersection index [L_1,..., L_n] as the number of…

It is well-known that Leonard pairs have a close connection with bispectral orthogonal polynomials of the Askey scheme. In this paper, we introduce the notion of a Leonard trio $(V,\oV,Z)$, an algebraic structure extending Leonard pairs,…

We introduce a new two-sided type system for verifying the correctness and incorrectness of functional programs with atoms and pattern matching. A key idea in the work is that types should range over sets of normal forms, rather than sets…

In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…

Set-valued tableaux play an important role in combinatorial $K$-theory. Separately, semistandard skyline fillings are a combinatorial model for Demazure atoms and key polynomials. We unify these two concepts by defining a set-valued…

String functions are important building blocks of characters of integrable highest modules over affine Kac--Moody algebras. Kac and Peterson computed string functions for affine Lie algebras of type $A_{1}^{(1)}$ in terms of Dedekind eta…

We obtain some Liouville type theorems for positive harmonic functions on compact Riemannian manifolds with nonnegative Ricci curvature and strictly convex boundary and partially verifies Wang's conjecture (J. Geom. Anal. 31 (2021)). For…

The Krotov combining construction of perfect 1-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect 1-error-correcting binary code can be constructed by this combining construction is…

A new approach to linear programming duality is proposed which relies on quadratic penalization, so that the relation between solutions to the penalized primal and dual problems becomes affine. This yields a new proof of Levin's duality…