Related papers: Monotone Catenary Degree in Numerical Monoids
We characterize the monotone bounded depth formula complexity for graph homomorphism and colored isomorphism polynomials using a graph parameter called the cost of bounded product depth baggy elimination tree. Using this characterization,…
We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.
The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…
There is an unproven duality theory hypothesizing that random discrete trees and their poissonized embeddings in continuous time share fundamental properties. We give additional evidence in favor of this theory by showing that several…
Several papers in the recent literature have studied factorization properties of affine monoids using the monoid's Betti elements. In this paper, we extend this study to more general rings and monoids. We open by demonstrating the issues…
We develop a monotone, two-scale discretization for a class of integrodifferential operators of order $2s$, $s \in (0,1)$. We apply it to develop numerical schemes, and derive pointwise convergence rates, for linear and obstacle problems…
The degree of a polynomial representing (or approximating) a function f is a lower bound for the number of quantum queries needed to compute f. This observation has been a source of many lower bounds on quantum algorithms. It has been an…
In this article we study decreasing and increasing factorisations of the cycle, which are decompositions of the cycle $(1~2\dots n)$ into a product of $n-1$ transpositions satisfying monotonicity conditions. We explicit a bijection between…
The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…
The classification of mixed-state topological order requires indices that behave monotonically under finite-depth quantum channels. In two dimensions, a braided $C^*$-tensor category, which corresponds to strong symmetry, arises from a…
Due to the outstanding capability of capturing underlying data distributions, deep learning techniques have been recently utilized for a series of traditional database problems. In this paper, we investigate the possibilities of utilizing…
Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…
For a positive real $\alpha$, we can consider the additive submonoid $M$ of the real line that is generated by the nonnegative powers of $\alpha$. When $\alpha$ is transcendental, $M$ is a unique factorization monoid. However, when $\alpha$…
It is well known that knots are countable in ordinary knot theory. Recently, knots {\it with intersections} have raised a certain interest, and have been found to have physical applications. We point out that such knots --equivalence…
In a recent paper, Bruns and von Thaden established a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves…
Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…
A bottleneck of a smooth algebraic variety $X \subset \mathbb{C}^n$ is a pair of distinct points $(x,y) \in X$ such that the Euclidean normal spaces at $x$ and $y$ contain the line spanned by $x$ and $y$. The narrowness of bottlenecks is a…
An atomic monoid is length-factorial if each two distinct factorizations of any element have distinct factorization lengths. We provide a characterization of length-factorial Krull monoids in terms of their class groups and the distribution…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
We define the affinization of an arbitrary monoidal category $\mathcal{C}$, corresponding to the category of $\mathcal{C}$-diagrams on the cylinder. We also give an alternative characterization in terms of adjoining dot generators to…