Branko J. Malesevic
In this paper we determine a number of meaningful compositions of higher order of a set of functions, which is considered in Malesevic (1998), in implicit and explicit form. Results which are obtained are applied to the vector analysis in order to determine the number of meaningful differential operations of higher order.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication laws, thereby providing a generic scheme furnishing combinatorial classes with an algebraic structure. The paper is meant as a gentle introduction to the concepts of composition and decomposition with the emphasis on combinatorial origin of the ensuing algebraic constructions.
We discuss here some computational aspects of the Combinatorial Nullstellensatz argument. Our main result shows that the order of magnitude of the symmetry group associated with permutations of the variables in algebraic constraints, determines the performance of algorithms naturally deduced from Alon's Combinatorial Nullstellensatz arguments. Finally we present a primal-dual polynomial constructions for certifying the existence or the non-existence of solutions to combinatorial problems.
Recently, Defant and Propp [2020] defined the degree of noninvertibility of a function $f\colon X\to Y$ between two finite nonempty sets by $\text{deg}(f)=\frac{1}{|X|}\sum_{x\in X}|f^{-1}(f(x))|$. We obtain an exact formula for the expected degree of noninvertibility of the composition of $t$ functions for every $t\in \mathbb{N}$. An equivalent formulation for the definition of the degree of noninvertibility is then the starting point for a generalization yielding a seemingly new combinatorial identity involving the Stirling transform of the signed Stirling numbers of the first kind.
The monic sequence that shifts left under convolution with itself is the Catalan numbers with 130+ combinatorial interpretations. Here we establish a combinatorial interpretation for the monic sequence that shifts left under composition: it counts permutations that contain a 3241 pattern only as part of a 35241 pattern. We give two recurrences, the first allowing relatively fast computation, the second similar to one for the Catalan numbers. Among the 4 times 4! = 96 similarly restricted patterns involving 4 letters (such as 4\underline{2}31: a 431 pattern only occurs as part of a 4231), four …
This is a review article on the combinatorial aspects of the mixed Hodge structure of a Milnor fibre of the isolated hypersurface singularity. We give a purely combinatorial method to compute spectral pairs of the singularity under the assumption of simplicial Newton boundary and non-degeneracy of the germ.
In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.
We illustrate how one can use basic combinatorial theory and computer programming technique (Python) to analyze the combinatorial game: Mahjong. The results confirm some folklore concerning the game, and expose some unexpected results. Related results and possible future research in connection to artificial intelligence are mentioned. Readers interested in the subject may further develop the techniques to deepen the study of the game, or study other combinatorial games.
We survey interactions between the topology and the combinatorics of complex hyperplane arrangements. Without claiming to be exhaustive, we examine in this setting combinatorial aspects of fundamental groups, associated graded Lie algebras, higher homotopy groups, cohomology rings, twisted homology with rank 1 complex coefficients, and Milnor fibers.
Combinatorics of positional colored compositions
该研究针对位置彩色组合，通过生成函数获取计数序列，讨论其与其他组合对象的联系并提供组合论证及推广，探索该类组合的核心性质与关联。
Combinatorial aspects of normal ordering of 3-dimensional skew polynomial rings
本文研究了三维非交换多项式环的正常排列组合特性，利用SageMath软件优化了PBW形式和交换规则中的正常排列计算。
We obtain two combinatorial results: an equality of Weyl groups and an inequality of roots, in the setting of generalised Bott-Samelson resolutions of minuscule Schubert varieties. These results are used in the companion paper [BK19] to describe minimal rational curves on these resolutions, and their relation to lines on the Schubert varieties.
In recent work, G. E. Andrews and G. Simay prove a surprising relation involving parity palindromic compositions, and ask whether a combinatorial proof can be found. We extend their results to a more general class of compositions that are palindromic modulo $m$, that includes the parity palindromic case when $m=2$. We then provide combinatorial proofs for the cases $m=2$ and $m=3$.
The prefix exchange distance of a permutation is the minimum number of exchanges involving the leftmost element that sorts the permutation. We give new combinatorial proofs of known results on the distribution of the prefix exchange distance for a random uniform permutation. We also obtain expressions for the mean and the variance of this distribution, and finally, we show that the normalised prefix exchange distribution converges in distribution to the standard normal distribution.
In this work, we give combinatorial proofs for generating functions of two problems, i.e., flushed partitions and concave compositions of even length. We also give combinatorial interpretation of one problem posed by Sylvester involving flushed partitions and then prove it. For these purposes, we first describe an involution and use it to prove core identities. Using this involution with modifications, we prove several problems of different nature, including Andrews' partition identities involving initial repetitions and partition theoretical interpretations of three mock theta functions of th…
The crank is a partition statistic requested by Dyson in 1944 in order to combinatorially prove a Ramanujan congruence of Euler's partition function $p(n)$. In this paper, we provide connections between Dyson's crank and unimodal compositions. Somewhat unrelated, we give a combinatorial proof of a new truncated Euler pentagonal number theorem due to Xia and Zhao.
The paper presents mathematical models of quasicrystals with particular attention given to cut-and-project sets. We summarize the properties of higher-dimensional quasicrystal models and then focus on the one-dimensional ones. For the description of their properties we use the methods of combinatorics on words.
In this article we propose an algebraic system, which is an abelian group $(A,+)$ with a family of non-associative and non-(left)distributive multiplications $\{\cdot_λ\}_{λ\in H}$. We call this algebraic system dynamical brace. The dynamical brace corresponds to a certain dynamical Yang-Baxter map (which is left nondegenerate and satisfy the unitary condition). Combinatorial aspects of the dynamical brace give us a correspondence between the dynamical brace and a certain family of subsets of $A\rtimes Aut(A)$. From this viewpoint we give an interpretation and examples of the dynamical brace.
For any simplicial complex on m vertices a moment-angle complex Z_K embedded in C^m can be defined. There is a canonical action of a torus T^m on Z_K, but this action fails to be free. The Buchstaber number is the maximal integer s(K) for which there exists a subtorus of rank s(K) acting freely on Z_K. The similar definition can be given for real Buchstaber number. We study these invariants using certain sequences of simplicial complexes called universal complexes. Some general properties of Buchstaber numbers follow from combinatorial properties of universal complexes. In particular, we inves…
We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and quaternary words, spanning trees in the ladder graph, unimodal sequences covering an initial interval, and ordered-consecutive partition sequences. Our approach relies on the basic idea of representing the colored compositions as tilings of an $n$-board whose tiles are connected, and sometimes decorated, according to a suitable combinatorial interpretation of the giv…
Some combinatorial aspects of (q,2)-Fock space
该研究在给定希尔伯特空间上引入(q,2)-Fock空间，推导产生与湮灭算符乘积作用于真空向量的显式形式，明确其关联的对分划特定子集并完成详细刻画，丰富了Fock空间的组合性质研究。
We survey several results connecting combinatorics and Wronskian solutions of the KP equation, contextualizing the successes of a recent approach introduced by Kodama, et. al. We include the necessary combinatorial and analytical background to present a formula for generalized KP solitons, compute several explicit examples, and indicate how such a perspective could be used to extend previous research relating line-soliton solutions of the KP equation with Grassmannians.
The Bernstein vertex operators, which can be used to build recursively the Schur functions, are extended to superspace. Four families of super vertex operators are defined, corresponding to the four natural families of Schur functions in superspace. Combinatorial proofs that the super Bernstein vertex operators indeed build the Schur functions in superspace recursively are provided. We briefly mention a possible realization, in terms of symmetric functions in superspace, of the super-KP hierarchy, where the tau-function naturally expands in one of the super-Schur bases.
Combinatorial aspects of Parraud's asymptotic expansion for GUE matrices
本文为 Parraud 关于多个独立 GUE 矩阵多项式期望迹的 $1/N^2$ 幂次渐近展开公式提供了新的组合证明，通过自由差商和半圆变量简化了表述，并阐明了其与组合亏格展开的关系。
The purpose of this paper is to review some combinatorial ideas behind the mirror symmetry for Calabi-Yau hypersurfaces and complete intersections in Gorenstein toric Fano varieties. We suggest as a basic combinatorial object the notion of a Gorenstein polytope of index r. A natural combinatorial duality for d-dimensional Gorenstein polytopes of index r extends the well-known polar duality for reflexive polytopes (case r=1). We consider the Borisov duality between two nef-partitions as a duality between two Gorenstein polytopes P and P^* of index r together with selected special (r-1)-dimensio…
Consider a permutation $σ\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $σ_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We study some probabilistic and combinatorial aspects of the shuffle on $S_n$ defined by removing and then randomly reinserting each of the $n$ cards once, with the removal and reinsertion being performed according to the original left to right order of the cards. The novelty here in this nonstandard shuffle is that every card is removed and reinserted exactly once. The bias that remains turns out to be q…
Let q be a power of a prime and E be an elliptic curve defined over F_q. In "Combinatorial aspects of elliptic curves" [17], the present author examined a sequence of polynomials which express the N_k's, the number of points on E over the field extensions F_{q^k}, in terms of the parameters q and N_1 = #E(F_q). These polynomials have integral coefficients which alternate in sign, and a combinatorial interpretation in terms of spanning trees of wheel graphs. In this sequel, we explore further ramifications of this connection. In particular, we highlight a relationship between elliptic curves an…
Agarwal introduced $n$-color compositions in 2000 and most subsequent research has focused on restricting which parts are allowed. Here we focus instead on restricting allowed colors. After three general results, giving recurrence formulas for the cases of given allowed colors, given prohibited colors, and colors satisfying modular conditions, we consider several more specific conditions, establishing direct formulas and connections to other combinatorial objects. Proofs are combinatorial, mostly using the notion of spotted tilings introduced by the first named author in 2012.
We show that combinatorial objects called row-strict composition tableaux, introduced by Mason and Remmel in 2014 and closely related to the quasi-symmetric Schur functions of Haglund-Luoto-Mason-van Willigenburg, form a basis for Schur functors of finite free modules over arbitrary commutative rings. When the ring is the complex numbers, this produces a new basis for the irreducible polynomial representations of $\operatorname{GL}_n(\mathbb{C})$. Moreover, in this case it also produces new basis for the Plücker algebra, a subalgebra of the polynomial ring over $\mathbb{C}$ in $n^2$ variables…
The inverse problem of general rough sets, considered by the present author in some of her earlier papers, in one of its manifestations is essentially the question of when an agent's view about crisp and non crisp objects over a set of objects has a rough evolution. In this research the nature of the problem is examined from number-theoretic and combinatorial perspectives under very few assumptions about the nature of data and some necessary conditions are proved.
Combinatorial and Topological Aspects of Path Posets, and Multipath Cohomology
本文研究路径偏序集的组合性质，提出多路上同调的无圈性准则与有向线性图上同调群计算，并探讨其作为单纯复形面偏序集的可实现性。
This paper studies a single-suit version of the card game War on a finite deck of cards. There are varying methods of how players put the cards that they win back into their hands, but we primarily consider randomly putting the cards back and deterministically always putting the winning card before the losing card. The concept of a \emph{passthrough} is defined, which refers to a player playing through all cards in their hand from a particular point in the game. We consider games in which the second player wins during their first passthrough. We introduce several combinatorial objects related …
Let $(N,Φ)$ be a circular Ferrero pair. We define the disk with center $b$ and radius $a$, $\mathcal{D}(a;b)$, as \[\mathcal{D}(a;b)=\{x\in Φ(r)+c\mid r\neq 0,\ b\in Φ(r)+c,\ |(Φ(r)+c)\cap (Φ(a)+b)|=1\}.\] We prove that in the field-generated case there are many analogies with the Euclidean geometry. Moreover, if $\mathcal{B}^{\mathcal{D}}$ is the set of all disks, then, in some interesting cases, we show that the incidence structure $(N,\mathcal{B}^{\mathcal{D}},\in)$ is actually a balanced incomplete block design.
Generalizing Eulerian Numbers via Semipermutations: Topological and Combinatorial Aspects
本文通过半排列与对称群的双射关系，推广欧拉数并探讨其拓扑与组合特性。
Combinatorial aspects of the non-symmetric strong spectral property for graphs
本文从组合学角度研究图的非对称强谱性质，提出一种新的方法识别需要该性质的矩阵模式，并证明双路径中的环赋值对建立该性质至关重要，同时验证了某些有向图家族中要求该性质的最小弧数为2n-1。
We define and study the combinatorial properties of compositional Bernoulli numbers and polynomials within the framework of rational combinatorics.
To any nodal curve $C$ is associated the degree class group, a combinatorial invariant which plays an important role in the compactification of the generalised Jacobian of $C$ and in the construction of the Néron model of the Picard variety of families of curves having $C$ as special fibre. In this paper we study this invariant. More precisely, we construct a wide family of graphs having cyclic degree class group and we provide a recursive formula for the cardinality of the degree class group of the members of this family. Moreover, we analyse the behaviour of the degree class group under stan…
Generating functions for compositions with constrained even parts
本文研究了具有受限偶数部分的组合生成函数，推导了闭式表达式和递推关系，应用于组合计数与统计分析。
Combinatorial aspects of multiple zeta values
本文利用多重zeta值的积分表示满足洗牌乘积规则，采用组合方法证明了Zagier猜想及类似循环和恒等式，并提出支持无限族推广恒等式的计算证据。
We study the integrals of type $I(a)=\int_{O_n}\prod u_{ij}^{a_{ij}}\,du$, depending on a matrix $a\in M_{p\times q}(\mathbb N)$, whose exact computation is an open problem. Our results are as follows: (1) an extension of the "elementary expansion" formula from the case $a\in M_{2\times q}(2\mathbb N)$ to the general case $a\in M_{p\times q}(\mathbb N)$, (2) the construction of the "best algebraic normalization" of $I(a)$, in the case $a\in M_{2\times q}(\mathbb N)$, (3) an explicit formula for $I(a)$, for diagonal matrices $a\in M_{3\times 3}(\mathbb N)$, (4) a modelling result in the case $a…
We provide a combinatorial interpretation of the reduced composition polynomials of Ardila and Doker [Adv. Appl. Math. 50 (2013), 607], and relate them to the $(1-q)$-transform of noncommutative symmetric functions.
Given an elliptic curve C, we study here $N_k = #C(F_{q^k})$, the number of points of C over the finite field F_{q^k}. This sequence of numbers, as k runs over positive integers, has numerous remarkable properties of a combinatorial flavor in addition to the usual number theoretical interpretations. In particular we prove that $N_k = - W_k(q, - N_1)$ where W_k(q,t) is a (q,t)-analogue of the number of spanning trees of the wheel graph. Additionally we develop a determinantal formula for N_k where the eigenvalues can be explicitly written in terms of q, N_1, and roots of unity. We also discuss …
This paper shows how the study of colored compositions of integers reveals some unexpected and original connection with the Invert operator. The Invert operator becomes an important tool to solve the problem of directly counting the number of colored compositions for any coloration. The interesting consequences arising from this relationship also give an immediate and simple criterion to determine whether a sequence of integers counts the number of some colored compositions. Applications to Catalan and Fibonacci numbers naturally emerge, allowing to clearly answer to some open questions. Moreo…
Quasi-triangular Hopf algebras were introduced by Drinfel'd in his construction of solutions to the Yang--Baxter Equation. This algebra is built upon $\mathcal{U}_h(\mathfrak{sl}_2)$, the quantized universal enveloping algebra of the Lie algebra $\mathfrak{sl}_2$. In this paper, combinatorial structure in $\mathcal{U}_h(\mathfrak{sl}_2)$ is elicited, and used to assist in highly intricate calculations in this algebra. To this end, a combinatorial methodology is formulated for straightening algebraic expressions to a canonical form in the case $n=1$. We apply this formalism to the quasi-triangu…
Arndt and De Morgan Integer Compositions
本文通过整数分解中的奇数部分证明了阿恩德特关于斐波那契数的观察，推广了降序条件并建立了两种分解类型的递推关系，连接了安德鲁斯和维诺特的研究。
Combinatorial Aspects of Weighted Free Poisson Random Variables
本文从正交多项式与非交叉分划统计角度研究加权（形变）自由泊松随机变量，定义了一类相关随机变量，给出其组合矩公式并揭示了形变的插值特性与极限性质。
Using polynomial equations to model combinatorial problems has been a popular tool both in computational combinatorics as well as an approach to proving new theorems. In this paper, we look at several combinatorics problems modeled by systems of polynomial equations satisfying special properties. If the equations are infeasible, Hilbert's Nullstellensatz gives a certificate of this fact. These certificates have been studied and exhibit combinatorial meaning. In this paper, we generalize some known results and show that the Nullstellensatz certificate can be viewed as enumerating combinatorial …
Combinatorial and analytic aspects of independence polynomials of zero divisor graphs
本文研究交换环中零因子图的独立多项式，证明了其系数序列具有单峰性和对数凹性，并刻画了零点的特征及其在平面上的环形区域。
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and geometric definition, but are also related to some deep algebraic structures. For instance, a special type of maps called constellations provides a unifying framework for some enumeration problems concerning factorizations in the symmetric group. Standing on a position where many domains meet, maps can be studied using a large variety of methods, and their enumer…
A superdiagonal composition is one in which the $i$-th part or summand is of size greater than or equal to $i$. In this paper, we study the number of palindromic superdiagonal compositions and colored superdiagonal compositions. In particular, we give generating functions and explicit combinatorial formulas involving binomial coefficients and Stirling numbers of the first kind.
Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on partitions with restricted parts, which were confirmed analytically by Andrews and Chern and combinatorially by Yang. Analogous to Euler's partition theorem, it is known that the number of compositions of $n$ with odd parts equals the number of compositions of $n+1$ with parts greater than one, as both numbers equal the Fibonacci number $F_n$. Recently, Sills provid…
Further Results for the Capacity Statistic Distribution on Compositions of 1's and 2's
该文研究由1和2组成的n的分拆集合上的容量分布，得到新的递推关系、总容量与符号平衡公式，给出代数及组合证明，补充已有结果的组合解释，并简要探讨容量与另外两个参数的联合分布。
In this short survey we present the appearance of some combinatorial notions in quantum field theory. We first focus on topological graph polynomials (the Tutte polynomial and its multivariate version) and their relation with the parametric representation of the commutative $Φ^4$ field theory. We then generalize this to ribbon graphs and present the relation of the Bollobás-Riordan polynomial with the parametric representation of some $Φ^4$ field theory on the non-commutative Moyal space. We also review the rôle played by the Connes-Kreimer Hopf algebra as the combinatorial backbone of the ren…
We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operads obtained from usual monoids such as the additive and multiplicative monoids of integers and cyclic monoids. They involve various familiar combinatorial objects: endofunctions, parking functions, packed words, permutations, planar rooted trees, trees with a fixed arity, Schröder trees, Motzkin words, integer compositions, directed animals, and segmented integer compositions. We also recover some already known (symmetric or not) op…
If $S$ is a cofinite set of positive integers, an "$S$-restricted composition of $n$" is a sequence of elements of $S$, denoted $\vecλ=(λ_1,λ_2,...)$, whose sum is $n$. For uniform random $S$-restricted compositions, the random variable ${\bf B}(\vecλ)=\prod_i λ_i$ is asymptotically lognormal. The proof is based upon a combinatorial technique for decomposing a composition into a sequence of smaller compositions.
The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian numbers have intimate relationships to the set.
Combinatorial Aspects of Elliptic Schubert Calculus
本研究将旗流形舒伯特演算的两个组合结果推广到等变椭圆上同调，推导了椭圆舒伯特类的Billey型局部化公式与A型旗流形的pipe dream模型，还验证了其退化为K-理论时可还原经典公式。
We give a combinatorial description of the composition factors of the induction product of two evaluation modules of the affine Iwahori-Hecke algebra of type GL(m). Using quantum affine Schur-Weyl duality, this yields a combinatorial description of the composition factors of the tensor product of two evaluation modules of the quantum affine algebra of type sl(n).
We propose geometrical methods for constructing square 01-matrices with the same number n of units in every row and column, and such that any two rows of the matrix contain at most one unit in common. These matrices are equivalent to n-regular bipartite graphs without 4-cycles, and therefore can be used for the construction of efficient bipartite-graph codes such that both the classes of its vertices are associated with local constraints. We significantly extend the region of parameters m,n for which there exist an n-regular bipartite graph with 2m vertices and without 4-cycles. In that way we…
We first give a combinatorial interpretation of coefficients of Chebyshev polynomials, which allows us to connect them with compositions of natural numbers. Then we describe a relationship between the number of compositions of a natural number in which a certain number of parts are p-1, and other parts are not less than p with compositions in which all parts are not less than p. Then we find a relationship between principal minors of a type of Hessenberg matrices and compositions of natural numbers.
We study combinatorial aspects of the sandpile model on wheel and fan graphs, seeking bijective characterisations of the model's recurrent configurations on these families. For wheel graphs, we exhibit a bijection between these recurrent configurations and the set of subgraphs of the cycle graph which maps the level of the configuration to the number of edges of the subgraph. This bijection relies on two key ingredients. The first consists in considering a stochastic variant of the standard Abelian sandpile model (ASM), rather than the ASM itself. The second ingredient is a mapping from a give…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。