相关论文: Self-modified difference ascent sequences
Difference balanced functions from $F_{q^n}^*$ to $F_q$ are closely related to combinatorial designs and naturally define $p$-ary sequences with the ideal two-level autocorrelation. In the literature, all existing such functions are…
We strengthen the standard bifurcation theorems for saddle-node, transcritical, pitchfork, and period-doubling bifurcations of maps. Our new formulation involves adding one or two extra terms to the standard truncated normal forms with…
In sequential recommendation systems, data augmentation and contrastive learning techniques have recently been introduced using diffusion models to achieve robust representation learning. However, most of the existing approaches use random…
We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…
Combinatorial transgressions are secondary invariants of a space admitting triangulations. They arise from subdivisions and are analogous to transgressive forms such as those arising in Chern-Weil theory. Unlike combinatorial characteristic…
We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when…
Generalized Fibonacci-like sequences appear in finite difference approximations of the Partial Differential Equations based upon replacing partial differential equations by finite difference equations. This paper studies properties of the…
What role do augmentations play in contrastive learning? Recent work suggests that good augmentations are label-preserving with respect to a specific downstream task. We complicate this picture by showing that label-destroying augmentations…
The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…
The global bifurcation diagrams for two different one-parametric perturbations ($+\lambda x$ and $+\lambda x^2$) of a dissipative scalar nonautonomous ordinary differential equation $x'=f(t,x)$ are described assuming that 0 is a constant…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
In this paper, six constructions of difference families are presented. These constructions make use of difference sets, almost difference sets and disjoint difference families, and give new point of views of relationships among these…
Structures where we have both a contravariant (pullback) and a covariant (pushforward) functoriality that satisfy base change can be encoded by functors out of ($\infty$-)categories of spans (or correspondences). In this paper we study the…
Starting from some considerations we make about the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that…
Recently, Jel\'{i}nek derived that the number of self-dual interval orders of reduced size $n$ is twice the number of row-Fishburn matrices of size $n$ by using generating functions. In this paper, we present a bijective proof of this…
We introduce a natural partial order in structurally natural finite subsets of the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling…
We introduce dicodensity monads: a generalisation of pointwise codensity monads generated by functors to monads generated by mixed-variant bifunctors. Our construction is based on the notion of strong dinaturality (also known as Barr…
A More Sums Than Difference (MSTD) set is a finite set of integers $A$ where the cardinality of its sumset, $A+A$, is greater than the cardinality of its difference set, $A-A$. Since addition is commutative while subtraction isn't, it was…
In this paper, we consider several combinatorial problems whose enumeration leads to the odd-indexed Fibonacci numbers, including certain types of Dyck paths, block fountains, directed column-convex polyominoes, and set partitions with no…
The category of topological spaces endowed with two marked points is equipped with two families $\mathbf F_n$ and $\mathbf H_n$ of functors to the category of abelian groups, indexed by a nonnegative integer $n$: namely, the functor…