Related papers: Motivic intersection complex
We exhibit geometric conditions on a family of toric hypersurfaces under which the value of a canonical normal function at a point of maximal unipotent monodromy is irrational.
We apply the specialization technique based on the decomposition of the diagonal to find an explicit example over $\mathbb{Q}$ of a quadric and cubic hypersurface in $\mathbb{P}^6$ such that their intersection is a smooth stably irrational…
This is essentially an erratum, with some example to indicate inconsistencies. Suppose $A=k[X_1, X_2, \ldots, X_n]$ is a polynomial ring over a field $k$. The Complete Intersection conjecture states that, for any ideal $I$ in $A$,…
Based on the fact that projective monomial curves in the plane are complete intersections, we give an effective inductive method for creating infinitely many monomial curves in the projective $n$-space that are set theoretic complete…
Although intersection homology lacks a ring structure, certain expressions (called uniform) in the intersection homology of an irreducible projective variety $X$ always give the same value, when computed via the decomposition theorem on any…
We prove a mixed characteristic analog of the Beilinson-Lichtenbaum Conjecture for p-adic motivic cohomology. It gives a description, in the stable range, of p-adic motivic cohomology (defined using algebraic cycles) in terms of…
In the theory of line graphs of undirected graphs there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, the exists no analogous…
We reconcile the multiplications on the homotopy rings of motivic ring spectra used by Voevodsky and Dugger. While the connection is elementary and similar phenomena have been observed in situations like supersymmetry, neither we nor other…
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…
When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…
We prove the existence of lattice isomorphic line arrangements having $\pi_1$-equivalent or homotopy-equivalent complements and non homeomorphic embeddings in the complex projective plane. We also provide two explicit examples, one is…
In this note, we give a motivic characterization of the integral cohomology of dual boundary complexes of smooth quasi-projective complex algebraic varieties. As a corollary, the dual boundary complex of any stably affine space (of positive…
We prove that any quadratic complete intersection with certain action of the symmetric group has the strong Lefschetz property over a field of characteristic zero. As a consequence of it we construct a new class of homogeneous complete…
In this short note we give an elementary proof of the fact that connections and their geometric parallel-transport counterpart are equivalent notions.
Mixed monotone systems form an important class of nonlinear systems that have recently received attention in the abstraction-based control design area. Slightly different definitions exist in the literature, and it remains a challenge to…
In this paper we completely characterize lattice ideals that are complete intersections or equivalently complete intersections finitely generated semigroups of $\bz^n\oplus T$ with no invertible elements, where $T$ is a finite abelian…
In this note we prove the complex counterpart of the S-inequality for complete Reinhardt sets. In particular, this result implies that the complex S-inequality holds for unconditional convex sets.
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
We propose a framework for reasoning about programs that manipulate coinductive data as well as inductive data. Our approach is based on using equational programs, which support a seamless combination of computation and reasoning, and using…
Differential modules are natural generalizations of complexes. In this paper, we study differential modules with complete intersection homology, comparing and contrasting the theory of these differential modules with that of the Koszul…