Related papers: A family of reductions for Schubert intersection p…

We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location problems with multiple matroid constraints. We complement our…

A common form of MapReduce application involves discovering relationships between certain pairs of inputs. Similarity joins serve as a good example of this type of problem, which we call a "some-pairs" problem. In the framework of Afrati et…

Contact reduction is very closely related to symplectic reduction, but it allows symmetries that are not manifest in Hamiltonian mechanics and moreover, solution of the reduced problems yields solution of the original problem without…

A symmetric characteristic singular integral equation with two fixed singularities at the endpoints in the class of functions bounded at the ends is analyzed. It reduces to a vector Hilbert problem for a half-disc and then to a vector…

We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…

We present a method for reducing the treewidth of a graph while preserving all of its minimal $s-t$ separators up to a certain fixed size $k$. This technique allows us to solve $s-t$ Cut and Multicut problems with various additional…

We say that a linear space is harmonious if it is resolvable and admits an automorphism group acting sharply transitively on the points and transitively on the parallel classes. Generalizing old results by the first author et al. we present…

We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic…

We prove a reducibility result for a linear Klein-Gordon equation with a quasi-periodic driving on a compact interval with Dirichlet boundary conditions. No assumptions are made on the size of the driving, however we require it to be fast…

We approximately compute the correspondence degree (as defined by Lazarsfeld and Martin) between two unbalanced complete intersections. This is accomplished by showing that the procedure of taking a subvariety of a product $Y \times Y'$ and…

Let $X$ be an isotropic Grassmannian of type $B$, $C$, or $D$. In this paper we calculate $K$-theoretic Pieri-type triple intersection numbers for $X$: that is, the sheaf Euler characteristic of the triple intersection of two arbitrary…

Lyapunov-Schmidt reduction is a dimensionality reduction technique in nonlinear systems analysis that is commonly utilised in the study of bifurcation problems in high-dimensional systems. The method is a systematic procedure for reducing…

The nonstandard Lagrangian representations of Ricatti and Riccati-type equations that exist in the literature cannot be obtained using Helmholtz solution of the inverse problem. In this work we consider Riccati and higher-order Riccati…

In this study, we identify a class of redundant transitivity constraints in a 0-1 integer linear programming formulation of the clique partitioning problem. The transitivity constraints in this class can be removed from the formulation…

In this paper we prove a residue formula for intersection pairings of reduced spaces of certain quasi-Hamiltonian G-spaces, by constructing the corresponding Hamiltonian G-space. Our argument closely follows the methods of a 1998 paper of…

We determine the graded decompositions of fusion products of finite-dimensional irreducible representations for simple Lie algebras of rank two. Moreover, we give generators and relations for these representations and obtain as a…

Schr\"{o}dinger bridge is a stochastic optimal control problem to steer a given initial state density to another, subject to controlled diffusion and deadline constraints. A popular method to numerically solve the Schr\"{o}dinger bridge…

In this paper, we study the existence of solutions to the scalar additive Jump problem and the Riemann boundary value problems in the context of vectorial Clifford analysis on domains with fractal boundaries. A reduction procedure is…

We study the problem of addition and subtraction using the Zeckendorf representation of integers. We show that both operations can be performed in linear time; in fact they can be performed by combinational logic networks with linear size…

This paper is devoted to Riemann-Hilbert problems with constraints. We obtain results characterizing the existence of solutions as well as the dimension of the solution space in terms of certain indices. As an application, we show how such…