相关论文: Representation of Numerical Semigroups by Dyck Pat…
In this paper we discuss various aspects of the problem of determining the minimal dimension of an injective linear representation of a finite semigroup over a field. We outline some general techniques and results, and apply them to…
We introduce and study a new partial order on Dyck paths. We prove that these posets are meet-semilattices. We show that their numbers of intervals are the same as the number of bicubic planar maps. We describe an unexpected connection with…
We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a…
In this article, we introduce the notion of representations of polyadic groups and we investigate the connection between these representations and those of retract groups and covering groups.
This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…
The pseudoparticle approach is a numerical technique to compute path integrals without discretizing spacetime. The basic idea is to integrate over those field configurations, which can be represented by a sum of a fixed number of localized…
We study a new kind of symmetric polynomials P_n(x_1,...,x_m) of degree n in m real variables, which have arisen in the theory of numerical semigroups. We establish their basic properties and find their representation through the power sums…
We study two classes of inverse semigroups built from directed graphs, namely graph inverse semigroups and a new class of semigroups that we refer to as Leavitt inverse semigroups. These semigroups are closely related to graph…
We present combinatorial bijections and identities between certain skew Young tableaux, Dyck paths, triangulations, and dissections.
It is known that the Hilbert space dimensionality for quasiparticles in an SU(2)_k Chern-Simons-Witten theory is given by the number of directed paths in certain Bratteli diagrams. We present an explicit formula for these numbers for…
The goal of these notes is to provide an introduction to rough partial differential equations. For this purpose, we will present the theory of rough paths to the extend as it is required. Applications to stochastic partial differential…
Given a positive rational $q$, we consider Dyck paths having height at most two with some constraints on the number of consecutive peaks and consecutive valleys, depending on $q$. We introduce a general class of Dyck paths, called rational…
We consider several classes of complete intersection numerical semigroups, aris- ing from many different contexts like algebraic geometry, commutative algebra, coding theory and factorization theory. In particular, we determine all the…
We introduce a probabilistic representation of the derivative of the semigroup associated to a multidimensional killed diffusion process defined on the half-space. The semigroup derivative is expressed as a functional of a process that is…
In this paper we introduce the notion of $n$-permutation numerical semigroup. While there are just three $2$-permutation numerical semigroups, there are infinitely many $n$-permutation numerical semigroups if $n > 2$. We construct $16$…
Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…
We give a bijective parameter representation for a sum of squares of numbers being equal to another sum of squares of numbers.
Let \Gamma=<\alpha, \beta > be a numerical semigroup. In this article we consider several relations between the so-called \Gamma-semimodules and lattice paths from (0,\alpha) to (\beta,0): we investigate isomorphism classes of…
Using spectral graph theory, we show how to obtain inequalities for the number of walks in graphs from nonnegative polynomials and present a new family of such inequalities.
Methods from additive number theory are applied to construct families of finitely generated linear semigroups with intermediate growth.