Related papers: $\mathtt{bimEX}$: A Mathematica package for exact …
We propose a new operator defined between two tensors, the broadcast product. The broadcast product calculates the Hadamard product after duplicating elements to align the shapes of the two tensors. Complex tensor operations in libraries…
We consider the problem of automatically decomposing operations over tensors or arrays so that they can be executed in parallel on multiple devices. We address two, closely-linked questions. First, what programming abstraction should…
The Invar package is introduced, a fast manipulator of generic scalar polynomial expressions formed from the Riemann tensor of a four-dimensional metric-compatible connection. The package can maximally simplify any polynomial containing…
\texttt{DiscoTEX} is a highly accurate numerical algorithm for computing numerical weak-form solutions to distributionally sourced partial differential equations (PDE)s. The aim of this second paper, succeeding \cite{da2024discotex}, is to…
The bicomplex Bergman spaces are studied for any bounded bicomplex domain. Its Bergman kernel is computed in terms of the kernels of the complex projections of the domain. We also introduce two additional reproducing kernel Hilbert spaces…
We present the $\textit{NumericalImplicitization}$ package for $\textit{Macaulay2}$, which allows for user-friendly computation of the invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values. This…
We propose a combinatorial method for computing explicit solutions to multi-parametric quadratic programs, which can be used to compute explicit control laws for linear model predictive control. In contrast to classical methods, which are…
We introduce the notion of a continuous biframe in a Hilbert space which is a generalization of discrete biframe in Hilbert space. Representation theorem for this type of generalized frame is verified and some characterizations of this…
Quasi-separable matrices are a class of rank-structured matriceswidely used in numerical linear algebra and of growing interestin computer algebra, with applications in e.g. the linearization ofpolynomial matrices. Various representation…
We consider an isomorphism between the idempotent convexity based on the maximum and the addition operations and the idempotent measure convexity on the maximum and the multiplication operations. We use this isomorphism to investigate…
The intimate link between complex geometry and the problem of the pre-metric formulation of electromagnetism is explored. In particular, the relationship between 3+1 decompositions of R4 and the decompositions of the vector space of…
We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
A relative Rota-Baxter algebra is a generalization of a Rota-Baxter algebra. Relative Rota-Baxter algebras are closely related to dendriform algebras. In this paper, we introduce bimodules over a relative Rota-Baxter algebra that fits with…
For a set theoretical solution of the Yang-Baxter equation $(X,\sigma)$, we define a d.g. bialgebra $B=B(X,\sigma)$, containing the semigroup algebra $A=k\{X\}/\langle xy=zt : \sigma(x,y)=(z,t)\rangle$, such that $k\otimes_A B\otimes_Ak$…
This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra…
Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…
The mathematical software system polymake provides a wide range of functions for convex polytopes, simplicial complexes, and other objects. A large part of this paper is dedicated to a tutorial which exemplifies the usage. Later sections…
We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued vectors. Algebraic methods exist for computing complex-valued decompositions of symmetric tensors, but here we focus on…
We provide a representation of the $C^*$-algebra generated by multidimensional integral operators with piecewise constant kernels and discrete ergodic operators. This representation allows us to find the spectrum and to construct the…