Related papers: Classification of constraints using chain by chain…
We consider the problem of constrained motion along a conic path under a given external potential function. The model is described as a second-class system capturing the behavior of a certain class of specific quantum field theories. By…
Addition chains are a classical construction for fast exponentiation and related computation problems. In this paper, we study a chain for a fixed integer $n$ by decomposing each generator into a \emph{determiner} and a \emph{regulator}…
We combine two recent ideas: cartesian differential categories, and restriction categories. The result is a new structure which axiomatizes the category of smooth maps defined on open subsets of $\R^n$ in a way that is completely algebraic.…
We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…
An application design is offered, which students of physics can use when authoring a solver for mechanical systems with constraints. A 'chainlist' concept is introduced to capture a constrained mechanical system configuration and to pass…
We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…
We provide a recursive construction of all the semi-Heyting algebras that can be defined on a chain with $n$ elements. This construction allows us to count them easily. We also compare the formula for the number of semi-Heyting chains thus…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
In this paper we describe an approach to constraint-based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order (MSO) logic are represented by tree automata recognizing the…
Constrained Hamiltonian systems fall into the realm of presymplectic geometry. We show, however, that also Poisson geometry is of use in this context. For the case that the constraints form a closed algebra, there are two natural Poisson…
This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…
We revisit the so-called sampling and discarding approach used to quantify the probability of constraint violation of a solution to convex scenario programs when some of the original samples are allowed to be discarded. Motivated by two…
The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent on identifying tractable subclasses. The main…
We introduce statistical constraints, a declarative modelling tool that links statistics and constraint programming. We discuss two statistical constraints and some associated filtering algorithms. Finally, we illustrate applications to…
General purpose correct-by-construction synthesis methods are limited to systems with low dimensionality or simple specifications. In this work we consider highly symmetrical counting problems and exploit the symmetry to synthesize provably…
One basic requirement of many studies is the necessity of classifying data. Clustering is a proposed method for summarizing networks. Clustering methods can be divided into two categories named model-based approaches and algorithmic…
We introduce evolving networks where new vertices preferentially connect to the more central parts of a network. This makes such networks compact. Finite networks grown under the preferential compactness mechanism have complex…
The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed…
The article gives a ring theoretic perspective on cluster algebras. Gei{\ss}-Leclerc-Schr\"oer prove that all cluster variables in a cluster algebra are irreducible elements. Furthermore, they provide two necessary conditions for a cluster…
We introduce a family of toric algebras defined by maximal chains of a finite distributive lattice. Applying results on stable set polytopes we conclude that every such algebra is normal and Cohen-Macaulay, and give an interpretation of its…