Related papers: The connectedness of some varieties and the Delign…
A digraph $\mathbb G$ is called weakly connected, strongly connected, and extremely connected if any two vertices of $\mathbb G$ are connected respectively by an oriented, a directed, and a symmetric path in $\mathbb G$. We investigate the…
We consider $n\times n$ real-valued matrices $A = (a_{ij})$ satisfying $a_{ii} \geq a_{i,i+1} \geq \dots \geq a_{in} \geq a_{i1} \geq \dots \geq a_{i,i-1}$ for $i = 1,\dots,n$. With such a matrix $A$ we associate a directed graph $G(A)$. We…
We give a criterion which determines when a union of one-dimensional Deligne-Lusztig varieties has a connected closure. We also obtain a new, short proof of the connectedness criterion for Deligne-Lusztig varieties due to Lusztig.
The Constraint Satisfaction Problem (CSP) is a problem of computing a homomorphism $\mathbf{R}\to \mathbf{\Gamma}$ between two relational structures, where $\mathbf{R}$ is defined over a domain $V$ and $\mathbf{\Gamma}$ is defined over a…
In this article, we consider a class of degenerate singular problems. The degeneracy is captured by the presence of a class of $p$-admissible weights, which may vanish or blow up near the origin. Further, the singularity is allowed to vary…
The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent on identifying tractable subclasses. The main…
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows (projections) and by finitely many forbidden…
The objective of this article is to prove the necessity statement in Crawley-Boevey's conjectural solution to the (tame) Deligne-Simpson problem. We use the nonabelian Hodge correspondence, variation of parabolic weights and results of…
We consider a new class of matrices associated to a real square matrix $A$ and to a vector $\vec{c} \in \{-1,1\}^n$ such that $c_1=1$ by using a map $\varphi_{\vec{c}}$ which turns out to be a conjugation of a matrix $A$ by a signature…
Processes of the form $pp\to anything \to X_i X_j \to x\bar{x} + y\bar{y} (+ \slashchar{E})$ are studied via a technique that may be viewed as an adaptation of time-honoured Dalitz plot analyses. $X_i$ and $X_j$ are new heavy states (with…
Constraint Satisfaction Problems (CSPs, for short) make up a class of problems with applications in many areas of computer science. The first classification of these problems was given by Schaeffer who showed that every CSP over the domain…
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are…
Forbidden Patterns Problems (FPPs) are a proper generalisation of Constraint Satisfaction Problems (CSPs). However, we show that when the input is connected and belongs to a class which has low tree-depth decomposition (e.g. structure of…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…
For a polynomial $P$ of degree $n$ and an $m$-tuple $\Lambda=(\lambda_1,\dots,\lambda_m)$ of distinct complex numbers, the dope matrix of $P$ with respect to $\Lambda$ is $D_P(\Lambda)=(\delta_{ij})_{i\in [1,m],j\in[0,n]}$, where…
For the algebraic group $SL_{l+1}(\mathbb{C})$ we describe a system of positive roots associated to conjugacy classes in its Weyl group. Using this we explicitly describe the algebra of regular functions on certain transverse slices to…
A point $p\in\mathbb{P}^N$ of a projective space is $h$-identifiable, with respect to a variety $X\subset\mathbb{P}^N$, if it can be written as linear combination of $h$ elements of $X$ in a unique way. Identifiability is implied by…
The Chern-Schwartz-MacPherson class (CSM) and the Segre-Schwartz-MacPherson class (SSM) are deformations of the fundamental class of an algebraic variety. They encode finer enumerative invariants of the variety than its fundamental class.…
Let $M,N$ be real-valued martingales such that $N$ is differentially subordinate to $M$. The paper contains the proofs of the following weak-type inequalities: (i) If $M\geq0$ and $0<p\leq1$, then \[\Vert N\Vert_{p,\infty}\leq2\Vert…
We prove a version of the Deligne conjecture for $n$-fold monoidal abelian categories $A$ over a field $k$ of characteristic 0, assuming some compatibility and non-degeneracy conditions for $A$. The output of our construction is a weak…