Related papers: The weakest nontrivial idempotent equations
Many numerical problems with input $x$ and output $y$ can be formulated as a system of equations $F(x, y) = 0$ where the goal is to solve for $y$. The condition number measures the change of $y$ for small perturbations to $x$. From this…
We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both sides is the preserved (the variables can be, however, separated…
We describe weak BCC-algebras (also called BZ-algebras) in which the condition $(xy)z=(xz)y$ is satisfied only in the case when elements $x,y$ belong to the same branch. We also characterize branchwise commutative and branchwise implicative…
The language of probability is used to define several different types of conditional statements. There are four principal types: subjunctive, material, existential, and feasibility. Two further types of conditionals are defined using the…
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a criterion which is a priori weaker. The argument is quite general; as well as the classical Euclidean case, it…
We introduce the notion of weak Lie 2-bialgebra. Roughly, a weak Lie 2-bialgebra is a pair of compatible 2-term $L_\infty$-algebra structures on a vector space and its dual. The compatibility condition is described in terms of the big…
Conditionals are useful for modelling, but are not always sufficiently expressive for capturing information accurately. In this paper we make the case for a form of conditional that is situation-based. These conditionals are more expressive…
The tensor rank decomposition problem consists of recovering the unique set of parameters representing a robustly identifiable low-rank tensor when the coordinate representation of the tensor is presented as input. A condition number for…
The concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced. The resulting conditional set theory is sufficiently rich in order to construct a conditional topology, a conditional…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation. A conditional knowledge base, consisting of a set of conditional assertions of the type "if ... then ...",…
A new seemingly weak axiomatic formulation of information algebras is given. It is shown how such information algebras can be embedded into set (information) algebras. In set algebras there is a natural relation of conditional independence…
Sufficient conditions are obtained for the existence of a vector with a one-dimensional or simple three-dimensional stationary subalgebra for an irreducible compact linear Lie algebra.
A theorem providing necessary conditions enabling one to map a nonlinear system of first order partial differential equations to an equivalent first order autonomous and homogeneous quasilinear system is given. The reduction to quasilinear…
New concept of conditional differential invariant is discussed that would allow description of equations invariant with respect to an operator under a certain condition. Example of conditional invariants of the projective operator is…
In this paper, we introduce a large class of (so-called) conditional indicators, on a complete probability space with respect to a sub $\sigma$-algebra. A conditional indicator is a positive mapping, which is not necessary linear, but may…
A trinomial algebra is a commutative finitely generated algebra given by a system of compatible relations each of which is a polynomial with three terms. Such algebras arise as the Cox rings of varieties admitting a complexity one torus…
We study whether a logic based on team semantics can be enriched with a conditional satisfying minimal requirements--namely, preservation of the closure property of the logic, Modus Ponens, and the Deduction Theorem. We show that such…
Classically, there are two model category structures on coalgebras in the category of chain complexes over a field. In one, the weak equivalences are maps which induce an isomorphism on homology. In the other, the weak equivalences are maps…