相关论文: Partially Ordered generalized patterns and k-ary w…

Generalized Drinfeld-Sokolov (DS) hierarchies are constructed through local reductions of Hamiltonian flows generated by monodromy invariants on the dual of a loop algebra. Following earlier work of De Groot et al, reductions based upon…

In this paper we study graphs defined by pattern-avoiding words. Word-representable graphs have been studied extensively following their introduction in 2000 and are the subject of a book published by Kitaev in 2015. Recently there has been…

In a previous paper, we saw how to create formulae for the sum of the terms of a harmonic progression of order $k$, $HP_k(n)$, with integer parameters, $a$ and $b$. In this new paper we make those formulae more general by lifting the…

Katugampola's 2015 study of generalized fractional differential operators produced triangular arrays of integer coefficients indexed by a fractional order r and by dimensions n and k, but no combinatorial interpretation has been established…

In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern…

This paper is on the inverse parameterized differential Galois problem. We show that surprisingly many groups do not occur as parameterized differential Galois groups over K(x) even when K is algebraically closed. We then combine the method…

Let $\mathcal{P}$ be an (unbounded) countable multiset of primes, let $G=\bigoplus_{p\in P}\mathbb{F}_p$. We study the $k$'th universal characteristic factors of an ergodic probability system $(X,\mathcal{B},\mu)$ with respect to some…

Let G be a locally compact Hausdorff group in which every element is of finite order, and let P(G) denote the class of all regular probability measures on G. In this note, it is observed that a characterization of algebraically regular…

It is a remarkable fact that for many statistics on finite sets of combinatorial objects, the roots of the corresponding generating function are each either a complex root of unity or zero. These and related polynomials have been studied…

We find generating functions for the number of words avoiding certain patterns or sets of patterns on at most 2 distinct letters and determine which of them are equally avoided. We also find the exact number of words avoiding certain…

To reduce the curse of dimensionality for Gaussian processes (GP), they can be decomposed into a Gaussian Process Network (GPN) of coupled subprocesses with lower dimensionality. In some cases, intermediate observations are available within…

We present a survey of results related to the solution of Kolmogorov--Nikolsky problem for Fourier sums on the classes of generalized Poisson integrals $C^{\alpha,r}_{\beta,p}$, which consists in finding of asymptotic equalities for exact…

We describe all inequalities among generalized diagonals in positive semi-definite matrices. These turn out to be governed by a simple partial order on the symmetric group. This provides an analogue of results of Drake, Gerrish, and…

This paper studies a partial order on the general linear group GL(V) called the absolute order, derived from viewing GL(V) as a group generated by reflections, that is, elements whose fixed space has codimension one. The absolute order on…

Gaussian processes (GPs) provide a probabilistic nonparametric representation of functions in regression, classification, and other problems. Unfortunately, exact learning with GPs is intractable for large datasets. A variety of approximate…

We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…

We present a new recursive generation algorithm for prefix normal words. These are binary strings with the property that no substring has more 1s than the prefix of the same length. The new algorithm uses two operations on binary strings,…

Years ago Zeev Rudnick defined the ${\lambda}$-Poisson generic sequences as the infinite sequences of symbols in a finite alphabet where the number of occurrences of long words in the initial segments follow the Poisson distribution with…

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

We introduce a class of $f(t)$-factorials, or $f(t)$-Pochhammer symbols, that includes many, if not most, well-known factorial and multiple factorial function variants as special cases. We consider the combinatorial properties of the…