For an affine Lie algebra ĝ, the coefficients of certain vertex operators that annihilate level k standard ĝ-modules are defining relations for modules. In this paper, we study a combinatorial structure leading terms these = 2 algebras type Cn(1) and main result is construction combinatorially parameterized among annihilating fields. It believed constructed will play key role in Gröbner-like ba...

The generalized list T -coloring is a common generalization of many graph coloring models, including classical coloring, L(p, q)-labeling, channel assignment and T -coloring. Every vertex from the input graph has a list of permitted labels. Moreover, every edge has a set of forbidden differences. We ask for such a labeling of vertices of the input graph with natural numbers, in which every vert...

III. Geometry There are three logically independent facets to calculating the transfer map through a bend magnet: physics, geometry, and representation. We will derive the exact map for transit through ideal bends while separating these three, esp., isolating the geometry problem from the other two.

Given an undirected graph, the Vertex Coloring Problem (VCP) consists of assigning a color to each vertex of the graph in such a way that two adjacent vertices do not share the same color and the total number of colors is minimized. DSATUR-based Branch-and-Bound algorithm (DSATUR) is an effective exact algorithm for the VCP. One of its main drawback is that a lower bound is computed only once a...

The queen graph coloring problem consists in covering a n × n chessboard with n queens, so that two queens of the same color cannot attack each other. When the size, n, of the chessboard is a multiple of 2 or 3, it is hard to color the queen graph with only n colors. We have developed an exact algorithm which is able to solve exhaustively this problem for dimensions up to n = 12 and find one so...

We investigate properties of differential and difference operators annihilating certain finite-dimensional spaces exponential functions in two variables that are connected to the representation real-valued trigonometric hyperbolic functions. Although appear a variety contexts, motivation behind this technical note comes from considering subdivision schemes where annihilation play an important r...

A q-analog of a Steiner system (briefly, q-Steiner system), denoted by S = Sq[t, k, n], is a set of k-dimensional subspaces of F n q such that each t-dimensional subspace of Fq is contained in exactly one element of S. Presently, q-Steiner systems are known only for t = 1 and in the trivial cases t = k and k = n. In this paper, the first known nontrivial q-Steiner systems with t ≥ 2 are constru...