Related papers: Fully reducible simple Venn diagrams
It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the…
The quantum lens spaces form a natural and well-studied class of noncommutative spaces which can be subjected to classification using algebraic invariants by drawing on the fully developed classification theory of unital graph…
In this paper we study the complete reducibility of representations of infinite-dimensional Lie algebras from the perspective of the representation theory of vertex algebras.
We study the generalized roundness of finite metric spaces whose distance matrix $D$ has the property that every row of $D$ is a permutation of the first row. The analysis provides a way to characterize subsets of the Hamming cube $\{ 0, 1…
Let K be a (commutative) field with characteristic not 2, and V be a linear subspace of n by n matrices that have at most two eigenvalues in K (respectively, at most one non-zero eigenvalue in K). We prove that the dimension of V is less…
It is well known that a finite-dimensional Lie algebra over a field of characteristic zero is simple exactly when its derivation algebra is simple. In this paper we characterize those Lie algebras of arbitrary dimension over any field that…
We discuss, on finite and infinite dimensional normed vector spaces, some versions of Radstr\"{o}m cancellation law (or lemma) that are suited for applications to set optimization problems. In this sense, we call our results "conic"…
In this paper, we investigate three fundamental problems regarding cut complexes of graphs: their realizability, the uniqueness of graph reconstruction from them, and their algorithmic recognition. We define the parameter $m(d,n)$ as the…
Motivated by a result of [1] which states that if F is a subgraph of a convex complete graph K_n and F contains no boundary edge of K_n and |E(F)| \leq n-3, then K_n - F admits a triangulation, we determine necessary and sufficient…
This paper is devoted to dimensional reductions via the norm resolvent convergence. We derive explicit bounds on the resolvent difference as well as spectral asymptotics. The efficiency of our abstract tool is demonstrated by its…
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.
In [5] I solved the Thom's conjecture that a proper Thom map is triangulable. In this paper I drop the properness condition in the semialgebraic case and, moreover, in the definable case in an o-minimal structure.
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
We study parameter spaces of linear series on projective curves in the presence of unibranch singularities, i.e. {\it cusps}; and to do so, we stratify cusps according to value semigroup. We show that {\it generalized Severi varieties} of…
We develop a general theory for irreducible homogeneous spaces $M= G/H$, in relation to the nullity $\nu$ of their curvature tensor. We construct natural invariant (different and increasing) distributions associated with the nullity, that…
We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…
We show that the monodromy of a spherical conical metric is reducible if and only if it has a real-valued eigenfunction with eigenvalue 2 in the holomorphic extension of the associated Laplace--Beltrami operator. Such an eigenfunction…
Recent progress concerning regularization of supersymmetric theories is reviewed. Dimensional reduction is reformulated in a mathematically consistent way, and an elegant and general method is presented that allows to study the…
A graph is universally $k$-edge-weightable if for every $k$-element set $Q\subset\mathbb{R}$, it admits a proper $Q$-edge weighting. The settled 1-2-3 conjecture implies that for any arithmetic progression $\{a,b,c\}$, every nice regular…
A space $X$ is said to be $C$-trivial if the total Chern class $c(\alpha)$ equals $1$ for every complex vector bundle $\alpha$ over $X$. In this note we give a complete homological classification of $C$-trivial closed smooth manifolds of…