相关论文: Enumerating the Saneblidze-Umble diagonal terms
In this paper we describe a procedure for calculating the number of regular octahedrons that have vertices with coordinates in the set {0,1,...,n}. As a result, we introduce a new sequence in ``The Online Encyclopedia of Integer Sequences"…
Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…
We present a method for the explicit diagonalization of some Hankel operators. This method allows us to recover classical results on the diagonalization of Hankel operators with the absolutely continuous spectrum. It leads also to new…
After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…
We review the enveloping algebra of the 10 dimensional chiral sigma matrices. To facilitate the computation of the product of several chiral sigma matrices we have developed a symbolic program. Using this program one can reduce the…
Making use of a newly developed package in the computer mathematics system SageMath, we show how to perform a full asymptotic analysis of certain types of sums that occur frequently in combinatorics, including explicit error bounds. We…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…
Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…
Symmetries play an critical role in finding analytic solutions to nonlinear differential equations. A symmetry is a mapping of the solutions of the differential equation into the solutions and have been studied extensively for over a…
We introduce a new technique for solving uni-parametric versions of linear programs, convex quadratic programs, and linear complementarity problems in which a single parameter is permitted to be present in any of the input data. We…
New bounds on the cardinality of permutation codes equipped with the Ulam distance are presented. First, an integer-programming upper bound is derived, which improves on the Singleton-type upper bound in the literature for some lengths.…
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…
In this paper we present an extension of known semidefinite and linear programming upper bounds for spherical codes and consider a version of this bound for distance graphs. We apply the main result for the distance distribution of a…
In this article, we discuss formal invariants of singularly-perturbed linear differential systems in neighborhood of turning points and give algorithms which allow their computation. The algorithms proposed are implemented in the computer…
In this paper we describe methods for computing rack and quandle cohomology. We illustrate these methods by completely determining the cohomology of prime dihedral quandles.
In the present paper the unconditional convergence and the invertibility of multipliers is investigated. Multipliers are operators created by (frame-like) analysis, multiplication by a fixed symbol, and resynthesis. Sufficient and/or…
We analyze fast diagonal methods for simple bilevel programs. Guided by the analysis of the corresponding continuous-time dynamics, we provide a unified convergence analysis under general geometric conditions, including H\"olderian growth…
Convex polyhedra are the basis for several abstractions used in static analysis and computer-aided verification of complex and sometimes mission critical systems. For such applications, the identification of an appropriate…
In this paper, we first give explicit formulas for the number of solutions of unweighted linear congruences with distinct coordinates. Our main tools are properties of Ramanujan sums and of the discrete Fourier transform of arithmetic…
We introduce the concept of embedding tensor on Malcev algebras. The representation and cohomology theory of embedding tensor on Malcev algebras are studied. Some applications in deformation and abelian extension are investigated.