Results 61 to 70 of about 167 (109)

Bounded Littlewood identity related to alternating sign matrices

open access: yesForum of Mathematics, Sigma
An identity that is reminiscent of the Littlewood identity plays a fundamental role in recent proofs of the facts that alternating sign triangles are equinumerous with totally symmetric self-complementary plane partitions and that alternating sign ...
Ilse Fischer
doaj   +1 more source

On Some Identities for k-Jacobsthal Numbers [PDF]

open access: yes, 2013
The aim of this paper is to obtain Binet formula for k-Jacobsthal numbers. And also with the help of Binet formula we obtain some properties for the k-Jacobsthal numbers.

core  

Topological recursion for fully simple maps from ciliated maps [PDF]

open access: yes
We solve a conjecture from the first and third authors that claims that fully simple maps, which are maps with non self-intersecting disjoint boundaries, satisfy topological recursion for the exchanged spectral curve \((y, x)\), making use of the ...
Garcia-Failde, Elba   +5 more
core   +1 more source

and

open access: yes, 2010
. A centrosymmetric permutation is one which is invariant under the reversecomplement operation, or equivalently one whose associated standard Young tableaux under the Robinson-Schensted algorithm are both invariant under the Schützenberger involution ...
Matteo Silimbani, Mark F. Flanagan
core  

Diagonal operators, \(q\)-Whittaker functions and rook theory

open access: yes
We discuss the problem posed by Bender, Coley, Robbins and Rumsey of enumerating the number of subspaces which have a given profile with respect to a linear operator over the finite field \(\mathbb{F}_q\).
Ram, Samrith, Schlosser, Michael J.
core   +1 more source

GA2 index of some graph operations

open access: yes, 2010
Let G = (V, E) be a graph. For e = uv ? E(G), nu (e) is the number of vertices of G lying closer to u than to v and nv (e) is the number of vertices of G lying closer to v than u. The GA2 index of G is defined as ?uv?E(G) 2?
G.H. Fath-Tabar   +2 more
core   +1 more source

On nested block designs geometry

open access: yes
Orthogonal designs, Orthogonal block structure, General balance, Commutativity of projectors, Commutative quadratic subspace, Primary 62J05, Secondary 05A15, 15A18,
Radosław Kala
core   +1 more source

Some collapsibility results for n-dimensional contingency tables

open access: yes
Collapsibility, Conditional independence, Contingency table, Log-linear model, Möbius inversion, Simpson’s paradox, Strict collapsibility, Primary 62H17, Secondary 62E99, Secondary 05A05,
P. Vellaisamy, V. Vijay
core   +1 more source

A refined enumeration of hex trees and related polynomials

open access: yes, 2015
A hex tree is an ordered tree of which each vertex has updegree 0, 1, or 2, and an edge from a vertex of updegree 1 is either left, median, or right. We present a refined enumeration of symmetric hex trees via a generalized binomial transform.
Richard P. Stanleyb   +5 more
core   +1 more source

© Hindawi Publishing Corp. FIRST HITTING TIMES OF SIMPLE RANDOM WALKS ON GRAPHS WITH CONGESTION POINTS

open access: yes, 2002
We derive the explicit formulas of the probability generating functions of the first hitting times of simple random walks on graphs with congestion points using group representations. 2000 Mathematics Subject Classification: 60G50, 60B15, 60K30, 05A15. 1.
Mihyun Kang
core  

Home - About - Disclaimer - Privacy