Related papers: Cut Vertices and Semi-Inclusive Deep Inelastic Pro…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper…
Factorization, in the sense defined for inclusive hard scattering, is discussed for diffractive hard scattering. A factorization theorem similar to its inclusive counterpart is presented for diffractive DIS. For hadron-hadron diffractive…
Gradient descent for matrix factorization exhibits an implicit bias toward approximately low-rank solutions. While existing theories often assume the boundedness of iterates, empirically the bias persists even with unbounded sequences. This…
Many problems in nonlinear analysis and optimization, among them variational inequalities and minimization of convex functions, can be reduced to finding zeros (namely, roots) of set-valued operators. Hence numerous algorithms have been…
We present a projection-based numerical integration technique to deal with embedded interface in finite element (FE) framework. The element cut by an embedded interface is denoted as a cut cell. We recognize elemental matrices of a cut cell…
In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…
We study processes with unstable particles in intermediate time-like states. It is shown that the amplitudes squared of such processes factor exactly in the framework of the model of unstable particles with continuous masses. Decay widths…
Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…
This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for separating disjunctive cuts, and investigate the impact of the normalization…
We introduce twisted matrix factorizations for quantum complete intersections of codimension two. For such an algebra, we show that in a given dimension, almost all the indecomposable modules with bounded minimal projective resolutions…
Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…
We study the Maximum Happy Vertices and Maximum Happy Edges problems. The former problem is a variant of clusterization, where some vertices have already been assigned to clusters. The second problem gives a natural generalization of…
In this paper we continue to study the degrees of matrix coefficients of intertwining operators associated to reductive groups over $p$-adic local fields. Together with previous analysis of global normalizing factors we can control the…
Graphs are a natural representation of data from various contexts, such as social connections, the web, road networks, and many more. In the last decades, many of these networks have become enormous, requiring efficient algorithms to cut…
The (electromagnetic or weak) current operator responsible for deep inelastic scattering (DIS) should be local and satisfy the well-known commutation relations with the representation operators of the Poincare group. The problem whether…
Sparse regularization techniques are well-established in machine learning, yet their application in neural networks remains challenging due to the non-differentiability of penalties like the $L_1$ norm, which is incompatible with stochastic…
We make use of point transformations to introduce new canonical variables for systems defined on a finite interval and on the half-line so that new position variables should take all real values from $-\infty$ to $\infty$. The completeness…
We consider a generalized version of the correlation clustering problem, defined as follows. Given a complete graph $G$ whose edges are labeled with $+$ or $-$, we wish to partition the graph into clusters while trying to avoid errors: $+$…
We present an ab initio study of inclusive semileptonic decays of heavy mesons from lattice QCD. Our approach is based on a recently proposed method, that allows one to address the study of these decays from the analysis of smeared spectral…