相关论文: Peak reduction technique in commutative algebra

Tree decompositions were developed by Robertson and Seymour. Since then algorithms have been developed to solve intractable problems efficiently for graphs of bounded treewidth. In this paper we extend tree decompositions to allow cycles to…

Starting from the (apparently) elementary problem of deciding how many different topological spaces can be obtained by gluing together in pairs the faces of an octahedron, we will describe the central role played by hyperbolic geometry…

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…

A proper formulation in the perturbative renormalization group method is presented to deduce amplitude equations. The formulation makes it possible not only avoiding a serious difficulty in the previous reduction to amplitude equations by…

We provide descriptions of the Whitehead groups, and the algebraic $K$-theory groups, of the fundamental group of a connected, oriented, closed $3$-manifold in terms of Whitehead groups of their finite subgroups and certain Nil-groups. The…

We develop the method of averaging in Clifford (geometric) algebras suggested by the author in previous papers. We consider operators constructed using two different sets of anticommuting elements of real or complexified Clifford algebras.…

We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, hypergraphs, relational structures, codes, permutation…

Metric embedding is a powerful tool used extensively in mathematics and computer science. We devise a new method of using metric embeddings recursively, which turns out to be particularly effective in $\ell_p$ spaces, $p>2$, yielding…

A celebrated theorem of Klein implies that any hypergeometric differential equation with algebraic solutions is a pull-back of one of the few standard hypergeometric equations with algebraic solutions. The most interesting cases are…

Grothendieck point residue is considered in the context of computational complex analysis. A new effective method is proposed for computing Grothendieck point residues mappings and residues. Basic ideas of our approach are the use of…

Finding maximum-weight independent sets in graphs is an important NP-hard optimization problem. Given a vertex-weighted graph $G$, the task is to find a subset of pairwise non-adjacent vertices of $G$ with maximum weight. Most recently…

Rook polynomials are a powerful tool in the theory of restricted permutations. It is known that the rook polynomial of any board can be computed recursively, using a cell decomposition technique of Riordan. In this paper, we give a new…

Sampling algorithms, hypergraph degree sequences, and polytopes play a crucial role in statistical analysis of network data. This article offers a brief overview of open problems in this area of discrete mathematics from the point of view…

In this paper we utilize the Proper Orthogonal Decomposition (POD) method for model order reduction in application to Smoluchowski aggregation equations with source and sink terms. In particular, we show in practice that there exists a…

Finding diverse solutions in combinatorial problems recently has received considerable attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study the following type of problems: given an integer $k$, the…

Semidefinite programming (SDP) is a fundamental class of convex optimization problems with diverse applications in mathematics, engineering, machine learning, and related disciplines. This paper investigates the application of the…

Coded computing is a distributed paradigm that uses coding theory to introduce \textit{redundancy} and overcome bottlenecks in large-scale systems. In the same vein, randomized numerical linear algebra employs probabilistic methods to…

This is an introduction to geometric algebra, an alternative to traditional vector algebra that expands on it in two ways: 1. In addition to scalars and vectors, it defines new objects representing subspaces of any dimension. 2. It defines…

Combinatorial optimization problems are pervasive across science and industry. Modern deep learning tools are poised to solve these problems at unprecedented scales, but a unifying framework that incorporates insights from statistical…

A method for aggregation of expert estimates in small groups is proposed. The method is based on combinatorial approach to decomposition of pair-wise comparison matrices and to processing of expert data. It also uses the basic principles of…