Related papers: Iterations of V and the core model
We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…
A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on…
Let $ R=k[x_1...x_r]$ and $M$ a multigraded $R-$module. In this work we interpret $M$ as a multipersistent homology module and give a multigraded resolution of it. The construction involves cellular resolutions of monomial ideals and…
We study the formalized v statement by allowing the occurrence of different arrays of quantifiers in it. We prove that for some specific arrays of quantifiers we get consistency statements that are S-equivalent to the original…
We study the birational geometry of moduli spaces of semistable sheaves on the projective plane via Bridgeland stability conditions. We show that the entire MMP of their moduli spaces can be run via wall-crossing. Via a description of the…
A lima\c{c}on-like curve, allowing 2{\pi}-transition with monotone curvature between concentric curvature elements, is presented. The curve is 4th degree algebraic, 4th degree rational, and shares other common features with Pascal's…
We address the problem of counting periodic orbits of vector fields on smooth closed manifolds. The space of non-constant periodic orbits is enlarged to a complete space by adding the ghost orbits, which are decorations of the zeros of…
The representation sets of central loops are investigated and the results obtained are used to construct a finite C-loop. It is shown that for certain types of isotopisms, the central identities are isotopic invariant.
We prove that the principal pivot transform (also known as the partial inverse, sweep operator, or exchange operator in various contexts) maps matrices with positive imaginary part to matrices with positive imaginary part. We show that the…
An appeal for symmetry is made to build established notions of specific representation and specific nonlinearity of measurement (often called model error) into a canonical linear regression model. Additive components are derived from the…
Jump systems are sets of integer vectors satisfying a simple axiom, generalizing matroids, also delta-matroids, and well-kown combinatorial examples such as degree sequences of subgraphs of a graph. It is useful to know if a set of vectors…
We consider the problem of deciding $\omega$-regular properties on infinite traces produced by linear loops. Here we think of a given loop as producing a single infinite trace that encodes information about the signs of program variables at…
Interaction models describe the exchange of messages between the different components of distributed systems. We have previously defined a small-step operational semantics for interaction models. The paper extends this work by presenting an…
In this paper we explore the representation property over sets. This property generalizes constructibility, however is weak enough to enable us to prove that the class of theories $T$ whose models are representable is exactly the class of…
A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we…
We construct an example of a real plane analytic singular metric, degenerating only at the origin, such that any gradient trajectory (respectively to this singular metric) of some well chosen function spirals around the origin. The…
A fundamental problem in program verification concerns the termination of simple linear loops of the form x := u ; while Bx >= b do {x := Ax + a} where x is a vector of variables, u, a, and c are integer vectors, and A and B are integer…
We prove that every many-sorted $\omega$-categorical theory is completely interpretable in a one-sorted $\omega$-categorical theory. As an application, we give a short proof of the existence of non $G$--compact $\omega$-categorical…
Suppose that there's no transitive model of ZFC + there's a strong cardinal, and let K denote the core model. It is shown that if \delta has the tree property then \delta^{+K} = \delta^+ and \delta is weakly compact in K.