Related papers: Inclusion-exclusion and Segre classes
Let $V$ be a possibly singular scheme-theoretic complete intersection subscheme of $\mathbb{P}^n$ over an algebraically closed field of characteristic zero. Using a recent result of Fullwood ("On Milnor classes via invariants of singular…
We introduce a formal integral on the system of varieties mapping properly and birationally to a given one, with value in an associated Chow group. Applications include comparisons of Chern numbers of birational varieties, new birational…
We define a power series associated with a homogeneous ideal in a polynomial ring, encoding information on the Segre classes defined by extensions of the ideal in projective spaces of arbitrarily high dimension. We prove that this power…
We introduce a new rule-based optimization method for classification with constraints. The proposed method leverages column generation for linear programming, and hence, is scalable to large datasets. The resulting pricing subproblem is…
We compare various viewpoints on down-sets (simplicial complexes), illustrating how the combinatorial inclusion-exclusion principle may serve as an alternative to more advanced methods of studying their face numbers.
The choice of a homogeneous ideal in a polynomial ring defines a closed subscheme $Z$ in a projective space as well as an infinite sequence of cones over $Z$ in progressively higher dimension projective spaces. Recent work of Aluffi…
Feature Selection techniques aim at finding a relevant subset of features that perform equally or better than the original set of features at explaining the behavior of data. Typically, features are extracted from feature ranking or subset…
In this note, the notion of cotorsion classes is introduced into the higher homological algebra. Our results motivate the definition, showing that this notion of $n$-cotorsion classes satisfies usual properties one could expect. In…
We consider the arithmetic complexity of index sets of uniformly computably enumerable families learnable under different learning criteria. We determine the exact complexity of these sets for the standard notions of finite learning,…
We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…
We consider strong combinatorial principles for sigma-directed families of countable sets in the ordering by inclusion modulo finite, e.g. P-ideals of countable sets. We try for principles as strong as possible while remaining compatible…
In this work we define a class of injective-type norm on tensor products through the environment of sequence classes. Examples and results on this norm will be presented and the duality is studied in this context. As a byproduct, we present…
We compute the multidegrees and the Segre numbers of general determinantal Cremona transformations, with generically reduced base scheme, by specializing to the standard Cremona transformation and computing its Segre class via mixed volumes…
When teaching an elementary logic course to students who have a general scientific background but have never been exposed to logic, we have to face the problem that the notions of deduction rule and of derivation are completely new to them,…
We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…
We introduce a notion of `proChow group' of varieties, agreeing with the notion of Chow group for complete varieties and covariantly functorial with respect to arbitrary morphisms. We construct a natural transformation from the functor of…
In this paper we propose a categorical theory of intensionality. We first revisit the notion of intensionality, and discuss we its relevance to logic and computer science. It turns out that 1-category theory is not the most appropriate…
We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…
Let G be a complex connected reductive group. The representation ring R(G) admits a canonical filtration defined in terms of the lambda-structure. We compute the associated graded ring gr R(G) (over Q) and the Chern classes of a…
The classical theorem of Milnor on pullback rings states that the category of projective modules over a pullback ring is equivalent to a certain category of gluing triples consisting of projective modules. We prove an analogous result on…