111,310 research outputs found
Why Delannoy numbers?
This article is not a research paper, but a little note on the history of
combinatorics: We present here a tentative short biography of Henri Delannoy,
and a survey of his most notable works. This answers to the question raised in
the title, as these works are related to lattice paths enumeration, to the
so-called Delannoy numbers, and were the first general way to solve Ballot-like
problems. These numbers appear in probabilistic game theory, alignments of DNA
sequences, tiling problems, temporal representation models, analysis of
algorithms and combinatorial structures.Comment: Presented to the conference "Lattice Paths Combinatorics and Discrete
Distributions" (Athens, June 5-7, 2002) and to appear in the Journal of
Statistical Planning and Inference
Enforcing the non-negativity constraint and maximum principles for diffusion with decay on general computational grids
In this paper, we consider anisotropic diffusion with decay, and the
diffusivity coefficient to be a second-order symmetric and positive definite
tensor. It is well-known that this particular equation is a second-order
elliptic equation, and satisfies a maximum principle under certain regularity
assumptions. However, the finite element implementation of the classical
Galerkin formulation for both anisotropic and isotropic diffusion with decay
does not respect the maximum principle.
We first show that the numerical accuracy of the classical Galerkin
formulation deteriorates dramatically with increase in the decay coefficient
for isotropic medium and violates the discrete maximum principle. However, in
the case of isotropic medium, the extent of violation decreases with mesh
refinement. We then show that, in the case of anisotropic medium, the classical
Galerkin formulation for anisotropic diffusion with decay violates the discrete
maximum principle even at lower values of decay coefficient and does not vanish
with mesh refinement. We then present a methodology for enforcing maximum
principles under the classical Galerkin formulation for anisotropic diffusion
with decay on general computational grids using optimization techniques.
Representative numerical results (which take into account anisotropy and
heterogeneity) are presented to illustrate the performance of the proposed
formulation
Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments
A digraph such that every proper induced subdigraph has a kernel is said to
be \emph{kernel perfect} (KP for short) (\emph{critical kernel imperfect} (CKI
for short) resp.) if the digraph has a kernel (does not have a kernel resp.).
The unique CKI-tournament is and the unique
KP-tournaments are the transitive tournaments, however bipartite tournaments
are KP. In this paper we characterize the CKI- and KP-digraphs for the
following families of digraphs: locally in-/out-semicomplete, asymmetric
arc-locally in-/out-semicomplete, asymmetric -quasi-transitive and
asymmetric -anti-quasi-transitive -free and we state that the problem
of determining whether a digraph of one of these families is CKI is polynomial,
giving a solution to a problem closely related to the following conjecture
posted by Bang-Jensen in 1998: the kernel problem is polynomially solvable for
locally in-semicomplete digraphs.Comment: 13 pages and 5 figure
Noether type discrete conserved quantities arising from a finite element approximation of a variational problem
In this work we prove a weak Noether type theorem for a class of variational
problems which include broken extremals. We then use this result to prove
discrete Noether type conservation laws for certain classes of finite element
discretisation of a model elliptic problem. In addition we study how well the
finite element scheme satisfies the continuous conservation laws arising from
the application of Noether's 1st Theorem (E. Noether 1918).
We summarise extensive numerical tests, illustrating the conservativity of
the discrete Noether law using the --Laplacian as an example.Comment: 17 pages, 3 figures, 3 table
On the algorithmic complexity of twelve covering and independence parameters of graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to covering and independence, each of which has been studied previously in some form. Here we survey briefly results concerning total coverings and total matchings of graphs, and consider the aforementioned 12 covering and independence parameters with regard to algorithmic complexity. We survey briefly known results for several graph classes, and obtain new NP-completeness results for the minimum total cover and maximum minimal total cover problems in planar graphs, the minimum maximal total matching problem in bipartite and chordal graphs, and the minimum independent dominating set problem in planar cubic graphs
- …