The number of even 321-avoiding permutations of length n is equal to the number of odd ones if n is even, and exceeds it by the n−1 2 th Catalan number otherwise. We present an involution that proves a refinement of this sign-balance property respecting the length of the longest increasing subsequence of the permutation. In addition, this yields a combinatorial proof of a recent analogous resul...

where Rk,r is the number of permutations of the integers {1, . . . , k} that contain an increasing subsequence of length at least r. Let Xy denote a positive integer valued random variable such that Prob (Xy ≥ r) = F (r; y). If R k,r denotes the complement of Rk,r, i.e. the number of permutations σ ∈ Sk all of whose increasing subsequences have length strictly less than r, then clearly R k,r = ...

We study the expressive power non-size increasing recursive definitions over lists. This notion of computation is such that the size of all intermediate results will automatically be bounded by the size of the input so that the interpretation in a finite model is sound with respect to the standard semantics. Many well-known algorithms with this property such as the usual sorting algorithms are ...

In this article, we introduce a new conception of a family of esport games called Samu Entropy to try to improve dataflow program graphs like the ones that are based on Google’s TensorFlow. Currently, the Samu Entropy project specifies only requirements for new esport games to be developed with particular attention to the investigation of the relationship between esport and artificial intellige...

We propose a linear type system with recursion operators for inductive datatypes which ensures that all definable functions are polynomial time computable. The system improves upon previous such systems in that recursive definitions can be arbitrarily nested; in particular, no predicativity or modality restrictions are made. 2003 Elsevier Science (USA). All rights reserved.

An exact solution for an SU(2) Yang-Mills field coupled to a scalar field is given, which has potentials with a linear and a Coulomb part. This may have some physical importance since many phenomenological QCD studies assume a linear plus Coulomb potential. Usually the linear potential is motivated with lattice gauge theory arguments. Here the linear potential is an exact result of the field eq...

Using parallel processing systems to execute scientiic applications is one of the most common solutions for achieving more eecient computing performance. However, those applications may contain loops with non-uniform dependencies which may cause a compiler to produce sequential codes. This paper presents a new scheduling methodology for non-uniform dependency loops, considering a limited number...

The original algorithm for the SAT problem, Variable Elimination Resolution (VER/DP) has exponential space complexity. To tackle that, the backtracking-based DPLL procedure [2] is used in SAT solvers. We present a combination of two techniques: we use NiVER, a special case of VER, to eliminate some variables in a preprocessing step, and then solve the simplified problem using a DPLL SAT solver....