نتایج جستجو برای: enumerative in combinatorics
تعداد نتایج: 16977528 فیلتر نتایج به سال:
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
In the present paper, enumeration of a certain class directed lattice paths is based on analysis dynamical correlation functions exactly solvable XX0 model. This model zero anisotropy limit one basic models theory integrable systems, XXZ Heisenberg magnet. It demonstrated that considered under different boundary conditions are exponential generating various types paths, in particular, Dyck and ...
Permutations of finite sets play a central role in algebraic and enumerative combinatorics. In addition to having many interesting enumerative properties per se, permutations also arise in almost every area of mathematics and indeed in all the sciences. Here we will discuss three different topics involving permutations, focusing on combinatorics but also giving some hints about connections with...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید