Related papers: Monotone Catenary Degree in Numerical Monoids
One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear block code) or…
We generalize the relation between discontinuities of scattering amplitudes and cut diagrams to cover sequential discontinuities (discontinuities of discontinuities) in arbitrary momentum channels. The new relations are derived using…
We study two notions of being well-structured for classes of graphs that are inspired by classic model theory. A class of graphs $C$ is monadically stable if it is impossible to define arbitrarily long linear orders in vertex-colored graphs…
In this paper we show that the depth and the Stanley depth of the factor of two monomial ideals is invariant under taking a so called canonical form. It follows easily that the Stanley Conjecture holds for the factor if and only if it holds…
We introduce monoidal width as a measure of complexity for morphisms in monoidal categories. Inspired by well-known structural width measures for graphs, like tree width and rank width, monoidal width is based on a notion of syntactic…
The necklace polynomials \[ M_n(x)=\frac1n\sum_{d\mid n}\mu(d)x^{n/d} \] play a central role in discrete mathematics: they count aperiodic necklaces, enumerate monic irreducible polynomials over finite fields, and give the dimensions of…
This paper studies the structure of core sets under different similarity classes. We investigate the influence of factors of the minimal polynomial with different degrees on the structure of core sets. When $F$ is a finite field of prime…
We study the P versus NP problem through properties of functions and monoids, continuing the work of [3]. Here we consider inverse monoids whose properties and relationships determine whether P is different from NP, or whether injective…
A key measure that has been used extensively in analyzing complex networks is the degree of a node (the number of the node's neighbors). Because of its discrete nature, when the degree measure was used in analyzing weighted networks,…
The height of a knotoid is a measure of how far it is from being a knot. Here we define the positive and negative parts of the height, and we prove that they determine the unsigned height. Some polynomial invariants provide lower bounds for…
Chains are vector-valued signals sampling a curve. They are important to motion signal processing and to many scientific applications including location sensors. We propose a novel measure of smoothness for chains curves by generalizing the…
We lay the geometric foundations for the study of the characteristic polynomial of tensors. For symmetric tensors of order $d \geq 3$ and dimension $2$ and symmetric tensors of order $3$ and dimension $3$, we prove that only finitely many…
The unit Euclidean distance degree and the generic Euclidean distance degree are two well-studied invariants of projective varieties. These quantities measure the algebraic complexity of nearest-point problems on a variety, and in many…
We develop a notion of iterated monoidal category and show that this notion corresponds in a precise way to the notion of iterated loop space. Specifically the group completion of the nerve of such a category is an iterated loop space and…
Topics concerning metric dimension related invariants in graphs are nowadays intensively studied. This compendium of combinatorial and computational results on this topic is an attempt of surveying those contributions that are of the…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
In this article we present the basis of Monoid Theory from a categorical point of view, emphasizing the analogies and differences between the theory of modules over commutative rings. We present the generalization of afine schemes and afine…
We study algebraic and arithmetic properties of submonoids (resp. subrings) of factorial monoids (resp. factorial domains) whose non-invertible elements all lie in the conductor. This continues earlier work of Baeth, Cisto, et al.. On our…