Search results for "Discrete Mathematics and Combinatorics"
showing 10 items of 230 documents
Cross-diffusion effects on stationary pattern formation in the FitzHugh-Nagumo model
2022
<p style='text-indent:20px;'>We investigate the formation of stationary patterns in the FitzHugh-Nagumo reaction-diffusion system with linear cross-diffusion terms. We focus our analysis on the effects of cross-diffusion on the Turing mechanism. Linear stability analysis indicates that positive values of the inhibitor cross-diffusion enlarge the region in the parameter space where a Turing instability is excited. A sufficiently large cross-diffusion coefficient of the inhibitor removes the requirement imposed by the classical Turing mechanism that the inhibitor must diffuse faster than the activator. In an extended region of the parameter space a new phenomenon occurs, namely the exis…
Quasi-Newton approach to nonnegative image restorations
2000
Abstract Image restoration, or deblurring, is the process of attempting to correct for degradation in a recorded image. Typically the blurring system is assumed to be linear and spatially invariant, and fast Fourier transform (FFT) based schemes result in efficient computational image restoration methods. However, real images have properties that cannot always be handled by linear methods. In particular, an image consists of positive light intensities, and thus a nonnegativity constraint should be enforced. This constraint and other ways of incorporating a priori information have been suggested in various applications, and can lead to substantial improvements in the reconstructions. Neverth…
Shape optimization for monge-ampére equations via domain derivative
2011
In this note we prove that, if $\Omega$ is a smooth, strictly convex, open set in $R^n$ $(n \ge 2)$ with given measure, the $L^1$ norm of the convex solution to the Dirichlet problem $\det D^2 u=1$ in $\Omega$, $u=0$ on $\partial\Omega$, is minimum whenever $\Omega$ is an ellipsoid.
Distance graphs and the T-coloring problem
1999
Abstract The T-coloring problem is, given a graph G = (V, E), a set T of nonnegative integers containing 0, and a ‘span’ bound s ⩾ 0, to compute an integer coloring f of the vertices of G such that |f(ν) − f(w)| ∉ T ∀νw ∈ E and max f − min f ⩽ s. This problem arises in the planning of channel assignments for broadcast networks. When restricted to complete graphs, the T-coloring problem boils down to a number problem which can be solved efficiently for many types of sets T. The paper presents results indicating that this is not the case if the set T is arbitrary. To these ends, the class of distance graphs is introduced, which consists of all graphs G : G ≅ G(A) for some (finite) set of posi…
On the additivity of block designs
2016
We show that symmetric block designs $${\mathcal {D}}=({\mathcal {P}},{\mathcal {B}})$$D=(P,B) can be embedded in a suitable commutative group $${\mathfrak {G}}_{\mathcal {D}}$$GD in such a way that the sum of the elements in each block is zero, whereas the only Steiner triple systems with this property are the point-line designs of $${\mathrm {PG}}(d,2)$$PG(d,2) and $${\mathrm {AG}}(d,3)$$AG(d,3). In both cases, the blocks can be characterized as the only k-subsets of $$\mathcal {P}$$P whose elements sum to zero. It follows that the group of automorphisms of any such design $$\mathcal {D}$$D is the group of automorphisms of $${\mathfrak {G}}_\mathcal {D}$$GD that leave $$\mathcal {P}$$P in…
On the classification of algebraic function fields of class number three
2012
AbstractLet F be an algebraic function field of one variable having a finite field Fq with q>2 elements as its field of constants. We determine all such fields for which the class number is three. More precisely, we show that, up to Fq-isomorphism, there are only 8 of such function fields. For q=2 the problem has been solved under the additional hypothesis that the function field is quadratic.
A smallest irregular oriented graph containing a given diregular one
2004
AbstractA digraph is called irregular if its vertices have mutually distinct ordered pairs of semi-degrees. Let D be any diregular oriented graph (without loops or 2-dicycles). A smallest irregular oriented graph F, F=F(D), is constructed such that F includes D as an induced subdigraph, the smallest digraph being one with smallest possible order and with smallest possible size. If the digraph D is arcless then V(D) is an independent set of F(D) comprising almost all vertices of F(D) as |V(D)|→∞. The number of irregular oriented graphs is proved to be superexponential in their order. We could not show that almost all oriented graphs are/are not irregular.
On Sturmian Graphs
2007
AbstractIn this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conjectures, by Moser and by Zaremba, on the continued fraction expansion of real numbers. These graphs turn out to be the underlying graphs of compact directed acyclic word graphs of central Sturmian words. In order to prove this result, we give a characterization of the maximal repeats of central Sturmian words. We show also that, in analogy with the case of Sturmian words, these graphs converge to infinite ones.
Grundy coloring for power graphs
2003
International audience
Partially Square Graphs, Hamiltonicity and Circumference II
2000
Abstract Given a graph G, its partially square graph G∗ is a graph obtained by adding an edge uv for each pair u, v of vertices of G at distance 2 whenever the vertices u and v have a common neighbor x satisfying the condition NG(x) ⊆ NG[u] ∪ NG[v], where NG[x]= NG(x) ∪ {x}. In case G is a claw-free graph, G∗ is equal to G2, We define σ ∗ t = min{ ∑ x∈ d ∗ G (x): S is an independent set in G ∗ and ∣S∣ = t} , where d ∗ G (x) = ∣{y ∈ V∣ xy ∈ E(G∗)}∣ . We give for hamiltonicity and circumference new sufficient conditions depending on and we improve some known results.