相关论文: Injectivity and the Law of Demand
In the study of homology cobordisms, knot concordance and link concordance, the following technical problem arises frequently: let $\pi$ be a group and let $M \to N$ be a homomorphism between projective $\Z[\pi]$-modules such that $\Z_p…
We prove that a polynomial map is invertible if and only if some associated differential ring homomorphism is bijective. To this end, we use a theorem of Crespo and Hajto linking the invertibility of polynomial maps with Picard-Vessiot…
We study the induced measure obtained from a 1-step Markov measure, supported by a topological Markov chain, after the mapping of the original alphabet onto another one. We give sufficient conditions for the induced measure to be a Gibbs…
Uniform proofs are sequent calculus proofs with the following characteristic: the last step in the derivation of a complex formula at any stage in the proof is always the introduction of the top-level logical symbol of that formula. We…
Let $k$ be an algebraically closed field of characteristic zero. Let $H:k^2\to k^2$ be a polynomial mapping such that the Jacobian $\text{Jac}\,H$ is a non-zero constant. In this note we prove, that if there is a line $l \subset k^2$ such…
Starting from the Hamilton-Jacobi equation describing a classical ensemble, one may infer a quantum dynamics using the principle of maximum uncertainty. That procedure requires an appropriate measure of uncertainty: Such a measure is…
It is shown that as knowledge is structured, it comes in modules. This provides different " layers of reality ". Each layer of reality has its own distinctive inductive logic which may differ from that of the others. All this is woven…
One of the most basic, longstanding open problems in the theory of dynamical systems is whether reachability is decidable for one-dimensional piecewise affine maps with two intervals. In this paper we prove that for injective maps, it is…
When dealing with certain mathematical problems, it is sometimes necessary to show that some function induces a metric on a certain space. When this function is not a well renowned example of a distance, one has to develop very particular…
We study a proof methodology for verifying the safety of data invariants of highly-available distributed applications that replicate state. The proof is (1) modular: one can reason about each individual operation separately, and (2)…
We prove that all injective maps on positive complex matrices which preserve order and shrink spectrum are implemented by unitary or antiunitary conjugations. We show by counterexamples that all assumptions are indispensable. The result…
Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…
The goal of this paper is to gather and develop some necessary and sufficient criteria for injectivity and multistationarity in vector fields associated with a chemical reaction network under a variety of more or less general assumptions on…
We extend previous work on injectivity in chemical reaction networks to general interaction networks. Matrix- and graph-theoretic conditions for injectivity of these systems are presented. A particular signed, directed, labelled, bipartite…
Various characterizations are offered of injectivity of the canonical fundamental group homomorphism for a certain class of inverse limit spaces. One application characterizes the existence of a kind of generalized universal cover.
Sufficient conditions for the wave instability in general three-component reaction-diffusion systems are derived. These conditions are expressed in terms of the Jacobian matrix of the uniform steady state of the system, and enable us to…
The rules in a shape grammar apply in terms of embedding to take advantage of the parts that emerge visually in the appearance of shapes. While the shapes are kept unanalyzed as a computation moves forward, part-structures for shapes can be…
Normalizing Flows (NFs) are powerful and efficient models for density estimation. When modeling densities on manifolds, NFs can be generalized to injective flows but the Jacobian determinant becomes computationally prohibitive. Current…
In a previous paper we have presented a CEGAR approach for the verification of parameterized systems with an arbitrary number of processes organized in an array or a ring. The technique is based on the iterative computation of parameterized…
We prove that an endomorphism $f$ of affine space is injective on rational points if its B\'ezoutian is constant. Similarly, $f$ is injective at a given rational point if its reduced B\'ezoutian is constant. We also show that if the…