A constructive approach to examination timetabling based on adaptive decomposition and ordering

In this study, we investigate an adaptive decomposition and ordering strategy that automatically divides examinations into difficult and easy sets for constructing an examination timetable. The examinations in the difficult set are considered to be hard to place and hence are listed before the ones in the easy set in the construction process. Moreover, the examinations within each set are ordered using different strategies based on graph colouring heuristics. Initially, the examinations are placed into the easy set. During the construction process, examinations that cannot be scheduled are identified as the ones causing infeasibility and are moved forward in the difficult set to ensure earlier assignment in subsequent attempts. On the other hand, the examinations that can be scheduled remain in the easy set. Within the easy set, a new subset called the boundary set is introduced to accommodate shuffling strategies to change the given ordering of examinations. The proposed approach, which incorporates different ordering and shuffling strategies, is explored on the Carter benchmark problems. The empirical results show that the performance of our algorithm is broadly comparable to existing constructive approaches.     

Restricted Modules and Conjectures for Modules of Constant Jordan Type

We introduce the class of restricted k[A]-modules and p ^t -Jordan types for a finite abelian p-group A of exponent at least p ^t and a field k of characteristic p. For these modules, we generalize several theorems by Benson, verify a generalization of conjectures stated by Suslin and Rickard giving constraints on Jordan types for modules of constant Jordan type when t is 1. We state conjectures giving constraints on p ^t -Jordan types and show that many p ^t -Jordan types are realizable.     

Green’s Functional for Higher-Order Ordinary Differential Equations with General Nonlocal Conditions and Variable Principal Coefficient

Ukrainian Mathematical Journal - The method of Green’s functional is a little-known technique for the construction of fundamental solutions to linear ordinary differential equations (ODE)...     

New Korovkin Type Theorem for Non-Tensor Meyer–König and Zeller Operators

In this paper, we introduce a certain class of linear positive operators via a generating function, which includes the non-tensor MKZ operators and their non-trivial extension. In investigating the approximation properties, we prove a new Korovkin type approximation theorem by using appropriate test functions. We compute the rate of convergence of these operators by means of the modulus of continuity and the elements of modified Lipschitz class functions. Furthermore, we give functional partial differential equations for this class. Using the corresponding equations, we calculate the first few moments of the non-tensor MKZ operators and investigate their approximation properties. Finally, we state the multivariate versions of the results and obtain the convergence properties of the multivariate Meyer–König and Zeller operators.     

Statistical Extensions of Some Classical Tauberian Theorems for Cesàro Summability of Triple Sequences

Some growth conditions of the resolvent function of a Banach space operator are investigated using higher order Cesàro means. More precisely, Abel and Nevanlinna estimates are obtained under the condition of boundedness of some weighted Cesàro averages. Also, certains results related to the (strong or uniform) convergence of Cesàro means are mentioned.     

Edge searching weighted graphs

In traditional edge searching one tries to clean all of the edges in a graph employing the least number of searchers. It is assumed that each edge of the graph initially has a weight equal to one. In this paper we modify the problem and introduce the Weighted Edge Searching Problem by considering graphs with arbitrary positive integer weights assigned to its edges. We give bounds on the weighted search number in terms of related graph parameters including pathwidth. We characterize the graphs for which two searchers are sufficient to clear all edges. We show that for every weighted graph the minimum number of searchers needed for a not-necessarily-monotonic weighted edge search strategy is enough for a monotonic weighted edge search strategy, where each edge is cleaned only once. This result proves the NP-completeness of the problem.     

Pro-torus actions on Poincaré duality spaces

In this paper, it is shown that some of the results of torus actions on Poincaré duality spaces, Borel’s dimension formula and topological splitting principle to local weights, hold if ‘torus’ is replaced by ‘pro-torus’.     

Some constructions of systematic authentication codes using galois rings

For q = p ^m and m ≥ 1, we construct systematic authentication codes over finite field using Galois rings. We give corrections of the construction of [2]. We generalize corresponding systematic authentication codes of [6] in various ways.