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

Xu and Wu (2001) defined the \emph{generalized wordlength pattern} $(A_1, ..., A_k)$ of an arbitrary fractional factorial design (or orthogonal array) on $k$ factors. They gave a coding-theoretic proof of the property that the design has…

The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact…

Symbolic regression (SR) with genetic programming (GP) aims to discover interpretable mathematical expressions directly from data. Despite its strong empirical success, the theoretical understanding of why GP-based SR generalizes beyond the…

We generalize the construction of affine polar graphs in two different ways to obtain new partial difference sets and amorphic association schemes. The first generalization uses a combination of quadratic forms and uniform cyclotomy. In the…

In this paper, we obtain additional results for a fractional counting process introduced and studied by Di Crescenzo et al. (2016). For convenience, we call it the generalized fractional counting process (GFCP). It is shown that the…

We develop generalized Petersson/Bruggeman-Kuznetsov (PBK) formulas for specified local components at non-archimedean places. In fact, we introduce two hypotheses on non-archimedean test function pairs $f \leftrightarrow \pi(f)$, called…

Skew-orthogonal polynomials (SOPs) arise in the study of the n-point distribution function for orthogonal and symplectic random matrix ensembles. Motivated by the average of characteristic polynomials of the Bures random matrix ensemble…

The method we have applied in "A. Bernini, L. Ferrari, R. Pinzani, Enumerating permutations avoiding three Babson-Steingrimsson patterns, Ann. Comb. 9 (2005), 137--162" to count pattern avoiding permutations is adapted to words. As an…

This paper studies three natural pre-orders of increasing generality on the set of all completely non-unitary partial isometries with equal defect indices. We show that the problem of determining when one partial isometry is less than…

This is my old unpublished paper called "The generalized Grassmann invariant". It shows how "pictures" also known as "Peiffer diagrams" represent elements of $H_3G$ for any group $G$ and shows that $K_3(\mathbb Z [G])$ is isomorphic to a…

We study the partial search order problem (PSOP) proposed recently by Scheffler [WG 2022]. Given a graph $G$ together with a partial order over the set of vertices of $G$, this problem determines if there is an $\mathcal{S}$-ordering that…

We say that a word $w$ on a totally ordered alphabet avoids the word $v$ if there are no subsequences in $w$ order-equivalent to $v$. In this paper we suggest a new approach to the enumeration of words on at most $k$ letters avoiding a…

Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…

In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…

The concept of p-ordering for a prime p was introduced by Manjul Bhargava (in his PhD thesis) to develop a generalized factorial function over an arbitrary subset of integers. This notion of p-ordering provides a representation of…

We count orientations of $G(n,p)$ avoiding certain classes of oriented graphs. In particular, we study $T_r(n,p)$, the number of orientations of the binomial random graph $G(n,p)$ in which every copy of $K_r$ is transitive, and $S_r(n,p)$,…

In 2011, Fici and Lipt\'ak introduced prefix normal words. A binary word is prefix normal if it has no factor (substring) that contains more occurrences of the letter 1 than the prefix of the same length. Among the open problems regarding…

Let G be the group of all formal power series starting with x with coefficients in a field k of zero characteristic (with the composition product), and let F[G] be its function algebra. C. Brouder and A. Frabetti introduced a…

We consider the algebra $R$ generated by three elements $A,B,H$ subject to three relations $[H,A]=A$, $[H,B]=-B$ and $\{A,B\}=f(H)$. When $f(H)=H$ this coincides with the Lie superalgebra $osp(1/2)$; when $f$ is a polynomial we speak of…

The theory of sparse stochastic processes offers a broad class of statistical models to study signals. In this framework, signals are represented as realizations of random processes that are solution of linear stochastic differential…