Related papers: On the Deligne-Simpson problem and its weak versio…
We study the martingale problem associated with the operator $L u = \partial_s u + 1/2 \sum_{i,j=1}^{d_0} a^{ij} \partial_{ij} u + \sum_{i,j=1}^d B^{ij} x^j \partial_i u$, where $d_0 \leq d$. We show that the martingale problem is…
We show an existence of a weak solution of a degenerate and/or singular semilinear elliptic boundary value (nonhomogeneous) problem lying between a given weak subsolution and a given weak supersolution. It has been applied for an existence…
We study the complexity of constraint satisfaction problems for templates $\Gamma$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A \cup B, E)$, with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given…
In this paper, we study a class of optimization problems, called Mathematical Programs with Cardinality Constraints (MPCaC). This kind of problem is generally difficult to deal with, because it involves a constraint that is not continuous…
We construct a class of finitely generated groups which have arbitrarily large conjugacy separability function, but in which the conjugacy problem can be solved in polynomial time, demonstrating that the McKinsey algorithm for the conjugacy…
When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B_1,..., B_p, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can…
We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…
The fixed-template constraint satisfaction problem (CSP) can be seen as the problem of deciding whether a given primitive positive first-order sentence is true in a fixed structure (also called model). We study a class of problems that…
We perform a comprehensive analysis of the Minimal Supersymmetric Standard Model (MSSM) in the scenario where the scalar partners of the fermions and the Higgs particles (except for the Standard-Model-like one) are assumed to be very heavy…
We investigate the generalized moment membership problem for matrices, a formulation equivalent to Skolem's problem for linear recurrence sequences. We show decidability for orthogonal, unitary, and real eigenvalue matrices, and…
We study the unitarity of monodromies of rank two Fuchsian systems of SL type with $(n+1)$ regular singularities on the Riemann sphere, namely, we give a sufficient and necessary condition for the monodromy group to be conjugate to a…
In this article, we study a boundary value problem of a class of singular linear discrete time systems whose coefficients are non-square constant matrices or square with a matrix pencil which has an identically zero determinant. By taking…
We study the case of a pseudo-scalar dark matter candidate which emerges from a complex scalar singlet, charged under a global U(1) symmetry, which is broken both explicitly and spontaneously. The pseudo-scalar is naturally stabilized by…
For certain negative rational numbers k0, called singular values, and associated with the symmetric group S_N on N objects, there exist homogeneous polynomials annihilated by each Dunkl operator when the parameter k = k0. It was shown by de…
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…
We consider optimization problems with a disjunctive structure of the constraints. Prominent examples of such problems are mathematical programs with equilibrium constraints or vanishing constraints. Based on the concepts of directional…
This article introduces the degenerate special Lagrangian equation (DSL) and develops the basic analytic tools to construct and study its solutions. The DSL governs geodesics in the space of positive graph Lagrangians in $\mathbb{C}^n.$…
We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…