相关论文: A Combinatorial Method for Computing Steenrod Squa…
We endow the cohomology of configuration spaces of a manifold with a product arising from superposing configurations. We prove that, under the scanning isomorphism, this product corresponds to the cup-product of the section space of the…
The spectral representation separates the contributions of geometrical arrangement (topology) and intrinsic constituent properties in a composite. The aim of paper is to present a numerical algorithm based on the Monte Carlo integration and…
We present a simple combinatorial model for the characters of the irreducible integrable highest weight modules for complex symmetrizable Kac-Moody algebras. This model can be viewed as a discrete counterpart to the Littelmann path model.…
We define a bar construction endofunctor on the category of commutative augmented monoids $A$ of a symmetric monoidal category $\mathcal{V}$ endowed with a left adjoint monoidal functor $F:s\mathbf{Set}\to \mathcal{V}$. To do this, we need…
We use a combinatorial approach to compute the number of non-isomorphic choices on four elements that can be explained by models of bounded rationality.
Combinatorial sputtering is a physical vapor deposition method that enables the high-throughput synthesis of compositionally varied thin films. Using this technique, the effects of stoichiometry on specific properties of alloy thin films…
We give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that…
We consider a classical N. Steenrod's problem on realization of homology classes by images of the fundamental classes of manifolds. It is well-known that each integral homology class can be realized with some multiplicity as an image of the…
We show how one can use non-prime-power, composite moduli for computing representations of the product of two $n\times n$ matrices using only $n^{2+o(1)}$ multiplications.
In this article, we present a unified algebraic-combinatorial framework for computing explicit, piecewise rational, and combinatorially indexed parametric formulas for volumes and higher moments of slices and slabs of polyhedral norm balls.…
In the past few years, successive improvements of the asymptotic complexity of square matrix multiplication have been obtained by developing novel methods to analyze the powers of the Coppersmith-Winograd tensor, a basic construction…
To factorize and to decompose the graphs of representative functions on the free monoid X * (generated by the alphabet X ) with values in the ring A containing Q, we examine various products of series (as concatenation, shuffle and its…
We present a simple combinatorial framework for establishing approximate tensorization of variance and entropy in the setting of spin systems (a.k.a. undirected graphical models) based on balanced separators of the underlying graph. Such…
It has long been envisioned that the strength of the barcode invariant of filtered cellular complexes could be increased using cohomology operations. Leveraging recent advances in the computation of Steenrod squares, we introduce a new…
We transport Steenrod's cup-i products from the singular cochains on the free loop space Maps(S^1, BG) to Hochschild's original cochain complex Hom (k[G]^*, k[G]) defining Hochschild cohomology. Here G is a discrete group, k an arbitrary…
Consider a smooth affine algebraic variety $X$ over an algebraically closed field, and let a finite group $G$ act on it. We assume that the characteristic of the field is greater than the dimension of $X$ and the order of $G$. An explicit…
It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…
In this paper, we address a way to reduce the total computational cost of meshless approximation by reducing the required stencil size through spatial variation of computational node regularity. Rather than covering the entire domain with…
In this rather brief note we present and discuss techniques for solving Kronecker matrix product least squares problems. Our main contribution is an iterative approach that uses the efficient Kronecker matrix-vector multiplication strategy…
We consider the problem of minimizing the composition of a smooth (nonconvex) function and a smooth vector mapping, where the inner mapping is in the form of an expectation over some random variable or a finite sum. We propose a stochastic…