scholarly journals Lozenge Tilings of a Halved Hexagon with an Array of Triangles Removed from the Boundary, Part II

10.37236/7502 ◽  
2018 ◽  
Vol 25 (4) ◽  
Author(s):  
Tri Lai

Proctor's work on staircase plane partitions yields an exact enumeration of lozenge tilings of a halved hexagon on the triangular lattice. Rohatgi later extended this tiling enumeration to a halved hexagon with a triangle cut off from the boundary. In his previous paper, the author proved  a common generalization of Proctor's and Rohatgi's results by enumerating lozenge tilings of a halved hexagon in the case an array of an arbitrary number of triangles has been removed from a non-staircase side. In this paper we consider the other case when the array of triangles has been removed from the staircase side of the halved hexagon. Our result also implies an explicit formula for the number of tilings of a hexagon with an array of triangles removed perpendicularly to the symmetry axis.

Author(s):  
Juan de Lara ◽  
Esther Guerra

AbstractModelling is an essential activity in software engineering. It typically involves two meta-levels: one includes meta-models that describe modelling languages, and the other contains models built by instantiating those meta-models. Multi-level modelling generalizes this approach by allowing models to span an arbitrary number of meta-levels. A scenario that profits from multi-level modelling is the definition of language families that can be specialized (e.g., for different domains) by successive refinements at subsequent meta-levels, hence promoting language reuse. This enables an open set of variability options given by all possible specializations of the language family. However, multi-level modelling lacks the ability to express closed variability regarding the availability of language primitives or the possibility to opt between alternative primitive realizations. This limits the reuse opportunities of a language family. To improve this situation, we propose a novel combination of product lines with multi-level modelling to cover both open and closed variability. Our proposal is backed by a formal theory that guarantees correctness, enables top-down and bottom-up language variability design, and is implemented atop the MetaDepth multi-level modelling tool.


1986 ◽  
Vol 9 (3) ◽  
pp. 323-342
Author(s):  
Joseph Y.-T. Leung ◽  
Burkhard Monien

We consider the computational complexity of finding an optimal deadlock recovery. It is known that for an arbitrary number of resource types the problem is NP-hard even when the total cost of deadlocked jobs and the total number of resource units are “small” relative to the number of deadlocked jobs. It is also known that for one resource type the problem is NP-hard when the total cost of deadlocked jobs and the total number of resource units are “large” relative to the number of deadlocked jobs. In this paper we show that for one resource type the problem is solvable in polynomial time when the total cost of deadlocked jobs or the total number of resource units is “small” relative to the number of deadlocked jobs. For fixed m ⩾ 2 resource types, we show that the problem is solvable in polynomial time when the total number of resource units is “small” relative to the number of deadlocked jobs. On the other hand, when the total number of resource units is “large”, the problem becomes NP-hard even when the total cost of deadlocked jobs is “small” relative to the number of deadlocked jobs. The results in the paper, together with previous known ones, give a complete delineation of the complexity of this problem under various assumptions of the input parameters.


1984 ◽  
Vol 24 (06) ◽  
pp. 606-616 ◽  
Author(s):  
Charles P. Thomas ◽  
Paul D. Fleming ◽  
William K. Winter

Abstract A mathematical model describing one-dimensional (1D), isothermal flow of a ternary, two-phase surfactant system in isotropic porous media is presented along with numerical solutions of special cases. These solutions exhibit oil recovery profiles similar to those observed in laboratory tests of oil displacement by surfactant systems in cores. The model includes the effects of surfactant transfer between aqueous and hydrocarbon phases and both reversible and irreversible surfactant adsorption by the porous medium. The effects of capillary pressure and diffusion are ignored, however. The model is based on relative permeability concepts and employs a family of relative permeability curves that incorporate the effects of surfactant concentration on interfacial tension (IFT), the viscosity of the phases, and the volumetric flow rate. A numerical procedure was developed that results in two finite difference equations that are accurate to second order in the timestep size and first order in the spacestep size and allows explicit calculation of phase saturations and surfactant concentrations as a function of space and time variables. Numerical dispersion (truncation error) present in the two equations tends to mimic the neglected present in the two equations tends to mimic the neglected effects of capillary pressure and diffusion. The effective diffusion constants associated with this effect are proportional to the spacestep size. proportional to the spacestep size. Introduction In a previous paper we presented a system of differential equations that can be used to model oil recovery by chemical flooding. The general system allows for an arbitrary number of components as well as an arbitrary number of phases in an isothermal system. For a binary, two-phase system, the equations reduced to those of the Buckley-Leverett theory under the usual assumptions of incompressibility and each phase containing only a single component, as well as in the more general case where both phases have significant concentrations of both components, but the phases are incompressible and the concentration in one phase is a very weak function of the pressure of the other phase at a given temperature. pressure of the other phase at a given temperature. For a ternary, two-phase system a set of three differential equations was obtained. These equations are applicable to chemical flooding with surfactant, polymer, etc. In this paper, we present a numerical solution to these equations paper, we present a numerical solution to these equations for I D flow in the absence of gravity. Our purpose is to develop a model that includes the physical phenomena influencing oil displacement by surfactant systems and bridges the gap between laboratory displacement tests and reservoir simulation. It also should be of value in defining experiments to elucidate the mechanisms involved in oil displacement by surfactant systems and ultimately reduce the number of experiments necessary to optimize a given surfactant system.


10.37236/9363 ◽  
2020 ◽  
Vol 27 (3) ◽  
Author(s):  
Daniel Condon

We give a formula for the number of lozenge tilings of a hexagon on the triangular lattice with unit triangles removed from arbitrary positions along two non-adjacent, non-opposite sides. Our formula implies that for certain families of such regions, the ratios of their numbers of tilings are given by simple product formulas.


1950 ◽  
Vol 2 ◽  
pp. 334-343 ◽  
Author(s):  
G. DE B. Robinson

1. Introduction. The problem of the expression of an invariant matrix of an invariant matrix as a direct sum of invariant matrices is intimately associated with the representation theory of the full linear group on the one hand and with the representation theory of the symmetric group on the other. In a previous paper the author gave an explicit formula for this reduction in terms of characters of the symmetric group. Later J. A. Todd derived the same formula using Schur functions, i.e. characters of representations of the full linear group.


1971 ◽  
Vol 8 (04) ◽  
pp. 708-715 ◽  
Author(s):  
Emlyn H. Lloyd

The present theory of finite reservoirs is not rich in general theorems even when of the simple Moran type, with unit draft and stationary discrete independent-sequence inflows. For the corresponding systems with unbounded capacity however there are two classes of results which have been known for some time. One of these classes is concerned with the time-dependent solution, where the theory provides a functional equation for the generating function of the time to first emptiness (Kendall (1957)), and the other with the asymptotic stationary distribution of reservoir contents, for which an explicit formula for the generating function is available (Moran (1959)).


1993 ◽  
Vol 30 (03) ◽  
pp. 627-638
Author(s):  
M. T. Dixon

An arbitrary number of competitors are presented with independent Poisson streams of offers consisting of independent and identically distributed random variables having the uniform distribution on [0, 1]. The players each wish to accept a single offer before a known time limit is reached and each aim to maximize the expected value of their offer. Rejected offers may not be recalled, but they are passed on to the other players according to a known transition matrix. This paper finds equilibrium points for two such games, and demonstrates a two-player game with an equilibrium point under which the player with the faster stream of offers has a lower expected reward than his opponent.


1993 ◽  
Vol 30 (3) ◽  
pp. 627-638 ◽  
Author(s):  
M. T. Dixon

An arbitrary number of competitors are presented with independent Poisson streams of offers consisting of independent and identically distributed random variables having the uniform distribution on [0, 1]. The players each wish to accept a single offer before a known time limit is reached and each aim to maximize the expected value of their offer. Rejected offers may not be recalled, but they are passed on to the other players according to a known transition matrix. This paper finds equilibrium points for two such games, and demonstrates a two-player game with an equilibrium point under which the player with the faster stream of offers has a lower expected reward than his opponent.


2019 ◽  
Vol 342 (2) ◽  
pp. 451-472
Author(s):  
Tri Lai ◽  
Ranjan Rohatgi

Author(s):  
Pavel Rajmic ◽  
Pavel Záviška ◽  
Vítězslav Veselý ◽  
Ondřej Mokrý

In theory and applications, it is often inevitable to work with projectors onto convex sets, where a linear transform is involved. In this article, a novel projector is presented, which generalizes previous results in that it admits a broader family of linear transforms, but on the other hand it is limited to box-type convex sets in the transformed domain. The new projector has an explicit formula and it can be interpreted within the framework of proximal optimization. The benefit of the new projector is demonstrated on an example from signal processing, where it was possible to speed up the convergence of a signal declipping algorithm by a factor of more than two.


Sign in / Sign up

Export Citation Format

Share Document