Related papers: The solution of the complete nontrivial cycle inte…

Crossover is the process of recombining the genetic features of two parents. For many applications where crossover is applied to permutations, relevant genetic features are pairs of adjacent elements, also called edges in the permutation…

We show that every thick subcategory of the singularity category of a complete intersection ring is self dual. We also prove the analogous statement for thick subcategories of the bounded derived category and give applications to the…

In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

We propose a definition of when a triangulated category should be considered a complete intersection. We show (using work of Avramov and Gulliksen) that for the derived category of a complete local Noetherian commutative ring R, the…

We provide a simple proof of the radial symmetry of any nonnegative minimizer for a general class of quasi-linear minimization problems

The purpose of this article is to present my new proof of the the construction and the convergence theorem of spectral sequences of filtered complexes, which is much shorter and cleaner than the "standard" proof.

We introduce the cycle intersection graph of a graph, an adaptation of the cycle graph of a graph, and use the structure of these graphs to prove an upper bound for the decycling number of all even graphs. This bound is shown to be…

We prove a new cross theorem for separately holomorphic functions.

In this note we show that pattern matching in permutations is polynomial time reducible to pattern matching in set partitions. In particular, pattern matching in set partitions is NP-Complete.

In this work I look at the distribution of primes by calculation of an infinite number of intersections. For this I use the set of all numbers which are not elements of a certain times table in each case. I am able to show that it exists a…

We give a new proof of Faber's intersection number conjecture concerning the top intersections in the tautological ring of the moduli space of curves $\M_g$. The proof is based on a very straightforward geometric and combinatorial…

We give an explicit formula for the arithmetic intersection number of CM cycles on Lubin-Tate spaces for all levels. We prove our formula by formulating the intersection number on the infinite level. Our CM cycles are constructed by…

A universal cycle (u-cycle) for permutations of length $n$ is a cyclic word, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$ are covered. It is known that…

Convergence results are stated for the variational iteration method applied to solve an initial value problem for a system of ordinary differential equations.

The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. That is, for every permutation $\pi = \pi_{1} \pi_{2} ... \pi_{n+1}$ there is a directed edge from the standardization of…

A set of $N$ permutations of $\{1,2,\dots,v\}$ is $(N,v,t)$-suitable if each symbol precedes each subset of $t-1$ others in at least one permutation. The central problems are to determine the smallest $N$ for which such a set exists for…

We prove that deciding whether a given input word contains as subsequence every possible permutation of integers $\{1,2,\ldots,n\}$ is coNP-complete. The coNP-completeness holds even when given the guarantee that the input word contains as…

A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…

We give a new proof of Tietze Theorem on the convergence of infinite semi-regular continued fractions.