Related papers: Enumerative combinatorics package for CoCoA
We describe a Common Lisp package suitable for the high-level design, specification, simulation, and instrumentation of real-time distributed algorithms and hardware on which to run them. We discuss various design decisions around the…
TopologicalNumbers.jl is an open-source Julia package designed to calculate topological invariants, mathematical quantities that characterize the properties of materials in condensed matter physics. These invariants, such as the Chern…
Mixed data arise when observations are described by a mixture of numerical and categorical variables. The R package PCAmixdata extends to this type of data standard multivariate analysis methods which allow description, exploration and…
We introduce the VirtualResolution package for the computer algebra system Macaulay2. This package has tools to construct, display, and study virtual resolutions for products of projective spaces. The package also has tools for generating…
Treating a realistic problem in any field of reaction kinetics raises a series of problems: we review these illustrated with examples using ReactionKinetics, a Mathematica based package.
Recently, we have developed an efficient generic partition refinement algorithm, which computes behavioural equivalence on a state-based system given as an encoded coalgebra, and implemented it in the tool CoPaR. Here we extend this to a…
In the pursuit of achieving near-term quantum advantage for combinatorial optimization problems, the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) are the primary methods of interest, but…
The application of combinatorial optimization problems to solving the problems of planning processes for industries based on a fund of reconfigurable production resources is considered. The results of their solution by mixed integer…
In many-particle problems involving interacting fermions or bosons, the most natural language for expressing the Hamiltonian, the observables, and the basis states is the language of the second-quantization operators. It thus appears…
Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…
Modern software systems are expected to be secure and contain all the latest features, even when new versions of software are released multiple times an hour. Each system may include many interacting packages. The problem of installing…
The authors propose new additive models for binary outcomes, where the components are copula-based regression models (Noh et al, 2013), and designed such that the model may capture potentially complex interaction effects. The models do not…
Combinatorial optimization problems play crucial roles in real-world applications, and many studies from a physics perspective have contributed to specialized hardware for high-speed computation. However, some combinatorial optimization…
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs…
In the field of scientific computing, one often finds several alternative software packages (with open or closed source code) for solving a specific problem. These packages sometimes even use alternative methodological approaches, e.g.,…
In this paper, a new python package (optipoly) is described that solves box-constrained optimization problem over multivariate polynomial cost functions. The principle of the algorithm is described before its performance is compared to…
We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers,…
In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.
In combinatorics, P\'{o}lya's Enumeration Theorem is a powerful tool for solving a wide range of counting problems, including the enumeration of groups, graphs, and chemical compounds. In this paper, we present an extension of P\'{o}lya's…
In the present paper by using Mathematica system a symbolic programming method for generation of the expressions of the expansion terms of atomic stationary perturbation theory (PT) is presented. For this purpose, the package named as…