Related papers: Freer Arrows and Why You Need Them in Haskell
Graph models have long been used in lieu of real data which can be expensive and hard to come by. A common class of models constructs a matrix of probabilities, and samples an adjacency matrix by flipping a weighted coin for each entry.…
In this paper we discuss the change in contact structures as their supporting open book decompositions have their binding components cabled. To facilitate this and applications we define the notion of a rational open book decomposition that…
The purpose of this paper is to give new examples of families of free singularities. We first show that a generic equidimensional subspace arrangement is free. Furthermore, we show that a product of two reduced Cohen-Macaulay subspaces is…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
Attribute reduction is a basic issue in knowledge representation and data mining. Rough sets provide a theoretical foundation for the issue. Matroids generalized from matrices have been widely used in many fields, particularly greedy…
In this paper, we give precise mathematical form to the idea of a structure whose data and axioms are faithfully represented by a graphical calculus; some prominent examples are operads, polycategories, properads, and PROPs. Building on the…
In this paper we discuss the variety of planar spiral segments and their applications in objects in both the real and artificial world. The discussed curves with monotonic curvature function are well-known in geometric modelling and…
Helical structures, almost ubiquitous in biological systems, have inspired the design and manufacturing of helical devices with applications in nanoelecromechanical systems (NEMS), morphing structures, optoelectronics, micro-robotics and…
In this work, we study 'reduction monads', which are essentially the same as monads relative to the free functor from sets into multigraphs. Reduction monads account for two aspects of the lambda calculus: on the one hand, in the monadic…
We show that certain algebraic structures lack freeness in the absence of the axiom of choice. These include some subgroups of the Baer-Specker group $\mathbb{Z}^{\omega}$ and the Hawaiian earring group. Applications to slenderness,…
The effective free energy of globular protein chain is considered to be a functional defined on smooth curves in three dimensional Euclidean space. From the requirement of geometrical invariance, together with basic facts on conformation of…
We consider the problem of placing arrow heads in directed graph drawings without them overlapping other drawn objects. This gives drawings where edge directions can be deduced unambiguously. We show hardness of the problem, present exact…
A new heuristic based on vertex invariants is developed to rapidly distinguish non-isomorphic graphs to a desired level of accuracy. The method is applied to sample subgraphs from an E.coli protein interaction network, and as a probe for…
Experimental analysis of the mechanics of a deformable object, and particularly its stability, requires repetitive testing and, depending on the complexity of the object's shape, a testing setup that can manipulate many degrees of freedom…
Linearisability is a central notion for verifying concurrent libraries: a given library is proven safe if its operational history can be rearranged into a new sequential one which, in addition, satisfies a given specification.…
A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…
We define specific multiplicities on the braid arrangement by using edge-bicolored graphs. To consider their freeness, we introduce the notion of bicolor-eliminable graphs as a generalization of Stanley's classification theory of free…
Forking is a central notion of model theory, generalizing linear independence in vector spaces and algebraic independence in fields. We develop the theory of forking in abstract, category-theoretic terms, for reasons both practical (we…
Through the implementation of reconfigurability to achieve flexibility and adaptation to tasks by morphology changes rather than by increasing the number of joints, malleable robots present advantages over traditional serial robot arms in…
We study polygon spaces arising from planar configurations of necklaces with some of the beads fixed and some of the beads sliding freely. These spaces include configuration spaces of flexible polygons and some other natural polygon spaces.…