Related papers: Isolated Suborders and their Application to Counti…
In this paper independent sets of closure operations are introduced. We characterize minimal keys and antikeys of closure operations in terms of independent sets. We establish an expression on the connection between minimal keys and…
We say that a subgroup $H$ is isolated in a group $G$ if for every $x\in G$ we have either $x\in H$ or $\langle x\rangle\cap H=1$. In this short note, we describe the set of isolated subgroups of a finite abelian group. The technique used…
Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…
Discovering patterns in a sequence is an important aspect of data mining. One popular choice of such patterns are episodes, patterns in sequential data describing events that often occur in the vicinity of each other. Episodes also enforce…
Elegant and general algorithms for handling upwards-closed and downwards-closed subsets of WQOs can be developed using the filter-based and ideal-based representation for these sets. These algorithms can be built in a generic or…
This paper presents methods for using zonotopes and constrained zonotopes to improve the practicality of a wide variety of set-based operations commonly used in control theory. The proposed methods extend the use of constrained zonotopes to…
Many complex engineering systems consist of multiple subsystems that are developed by different teams of engineers. To analyse, simulate and control such complex systems, accurate yet computationally efficient models are required. Modular…
Many Properties of a category X, as for instance the existence of an adjoint or a factorization system, are a consequence of the cowellpoweredness of X. In the absence of cowellpoweredness, for general results, fairly strong assumption on…
We associate to an integral operator a discrete one which is conceptually simpler, and study the relations between them.
We develop a new symbolic-numeric algorithm for the certification of singular isolated points, using their associated local ring structure and certified numerical computations. An improvement of an existing method to compute inverse systems…
We introduce the concept of isolated factorizations of an element of a commutative monoid and study its properties. We give several bounds for the number of isolated factorizations of simplicial affine semigroups and numerical semigroups.…
Cooperative constraint solving is an area of constraint programming that studies the interaction between constraint solvers with the aim of discovering the interaction patterns that amplify the positive qualities of individual solvers.…
We give some applications of closure operators in category of groups and link them with the join problem of subnormal subgroups.
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
A compression algorithm is presented that uses the set of prime numbers. Sequences of numbers are correlated with the prime numbers, and labeled with the integers. The algorithm can be iterated on data sets, generating factors of doubles on…
This paper shows how the study of colored compositions of integers reveals some unexpected and original connection with the Invert operator. The Invert operator becomes an important tool to solve the problem of directly counting the number…
The notion of singular reduction operators, i.e., of singular operators of nonclassical (conditional) symmetry, of partial differential equations in two independent variables is introduced. All possible reductions of these equations to…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Starting from pseudometrics and preorders on sets of integers, we extend the focus to sets of finite sequences of integers, in particular sequences of consecutive integers. We outline existing concepts for deriving centred pseudometrics and…
The notion of computability closure has been introduced for proving the termination of the combination of higher-order rewriting and beta-reduction. It is also used for strengthening the higher-order recursive path ordering. In the present…