Search results for "Discrete Mathematics"

Lambda substitution algebras

1993

In the paper an algebraic metatheory of type-free λ-calculus is developed. Our version is based on lambda substitution algebras (λSAs), which are just SAs introduced by Feldman (for algebraizing equational logic) enriched with a countable family of unary operations of λ-abstraction and a binary operation of application. Two representation theorems, syntactical and semantic, are proved, what directly provides completeness theorems.

On many-sorted algebraic closure operators

2004

A theorem of Birkhoff-Frink asserts that every algebraic closure operator on an ordinary set arises, from some algebraic structure on the set, as the corresponding generated subalgebra operator. However, for many-sorted sets, i.e., indexed families of sets, such a theorem is not longer true without qualification. We characterize the corresponding many-sorted closure operators as precisely the uniform algebraic operators. (© 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

Asymptotically good codes from generalized algebraic-geometry codes

2005

We consider generalized algebraic-geometry codes, based on places of the same degree of a fixed algebraic function field over a finite field. In this note, using a method similar to the Justesen's one, we construct a family of such codes which is asymptotically good.

ON AUTOMORPHISMS OF GENERALIZED ALGEBRAIC-GEOMETRY CODES.

2007

Abstract We consider a class of generalized algebraic-geometry codes based on places of the same degree of a fixed algebraic function field over a finite field F / F q . We study automorphisms of such codes which are associated with automorphisms of F / F q .

Theorems of ascoli type involving measures of noncompactness

1981

Linear and cyclic radio k-labelings of trees

2007

International audience; Motivated by problems in radio channel assignments, we consider radio k-labelings of graphs. For a connected graph G and an integer k ≥ 1, a linear radio k-labeling of G is an assignment f of nonnegative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two distinct vertices x and y, where dG(x,y) is the distance between x and y in G. A cyclic k-labeling of G is defined analogously by using the cyclic metric on the labels. In both cases, we are interested in minimizing the span of the labeling. The linear (cyclic, respectively) radio k-labeling number of G is the minimum span of a linear (cyclic, respectively) radio k-labeling of G. In this p…

Preface

2018

This issue of Discrete and Continuous Dynamical Systems-Series S focuses on the qualitative analysis of some concrete nonlinear problems, e.g., ordinary, partial differential equations, systems and inclusions. The ten contributions collected here give an overview on some very recent results on the existence, multiplicity and sign information of the solutions of a wide range of nonlinear differential problems involving different boundary value conditions and operators in divergence form. In our opinion, the synergy pointed out here between the classical nonlinear analysis methods, like the critical point theory, sub-super solutions methods, truncation and comparison techniques, Morse theory,…

Melnikov functions and Bautin ideal

2001

The computation of the number of limit cycles which appear in an analytic unfolding of planar vector fields is related to the decomposition of the displacement function of this unfolding in an ideal of functions in the parameter space, called the Ideal of Bautin. On the other hand, the asymptotic of the displacement function, for 1-parameter unfoldings of hamiltonian vector fields is given by Melnikov functions which are defined as the coefficients of Taylor expansion in the parameter. It is interesting to compare these two notions and to study if the general estimations of the number of limit cycles in terms of the Bautin ideal could be reduced to the computations of Melnikov functions for…

On the steady state problem of the chemotaxis-consumption model with logistic growth and Dirichlet boundary condition for signal

2023

This paper concerns the steady state problem for chemotaxis consumption system with logistic growth and constant concentration of chemoat-tractant on the boundary of the domain. We establish the existence of a non-constant positive solution to this problem. The uniqueness of this solution is obtained under the smallness assumption on the boundary data. Some qualitative properties of the solutions and numerical results are presented.

Heuristics and meta-heuristics for 2-layer straight line crossing minimization

2003

AbstractThis paper presents extensive computational experiments to compare 12 heuristics and 2 meta-heuristics for the problem of minimizing straight-line crossings in a 2-layer graph. These experiments show that the performance of the heuristics (largely based on simple ordering rules) drastically deteriorates as the graphs become sparser. A tabu search metaheuristic yields the best results for relatively dense graphs, with a GRASP implementation as close second. Furthermore, the GRASP approach outperforms all other approaches when tackling low-density graphs.