Search results for "Combinatorics"

On the number of singularities, zero curvature points and vertices of a simple convex space curve

1995

We prove a generalization of the 4 vertex theorem forC3 closed simple convex space curves including singular and zero curvature points.

Classification of cat ganglion retinal cells and implications for shape-function relationship

2002

This article presents a quantitative approach to ganglion cell classification by considering combinations of several geometrical features including fractal dimension, symmetry, diameter, eccentricity and convex hull. Special attention is given to moment and symmetry-based features. Several combinations of such features are fed to two clustering methods (Ward's hierarchical scheme and K-Means) and the respectively obtained classifications are compared. The results indicate the superiority of some features, also suggesting possible biological implications.

Strictly convex metric spaces with round balls and fixed points

2005

An upper bound for nonlinear eigenvalues on convex domains by means of the isoperimetric deficit

2010

We prove an upper bound for the first Dirichlet eigenvalue of the p-Laplacian operator on convex domains. The result implies a sharp inequality where, for any convex set, the Faber-Krahn deficit is dominated by the isoperimetric deficit.

R Code for Hausdorff and Simplex Dispersion Orderings in the 2D Case

2010

This paper proposes a software implementation using R of the Hausdorff and simplex dispersion orderings. A copy can be downloaded from http://www.uv.es/~ayala/software/fun-disp.R . The paper provides some examples using the functions exactHausdorff for the Hausdorff dispersion ordering and the function simplex for the simplex dispersion orderings. Some auxiliary functions are commented too.

The project scheduling polyhedron: Dimension, facets and lifting theorems

1993

Abstract The Project scheduling with resource constraints can be formulated as follows: given a graph G with node set N, a set H of directed arcs corresponding to precedence relations, and a set H′ of disjunctive arcs reflecting the resource incompatibilities, find among the subsets of H′ satisfying the resource constraints the set S that minimizes the longest path in graph (N, H ∪ S). We define the project scheduling polyhedron Qs as the convex hull of the feasible solutions. We investigate several classes of inequalities with respect to their facet-defining properties for the associated polyhedron. The dimension of Qs is calculated and several inequalities are shown to define facets. For …

Elementary Integration of Superelliptic Integrals

2021

Consider a superelliptic integral $I=\int P/(Q S^{1/k}) dx$ with $\mathbb{K}=\mathbb{Q}(\xi)$, $\xi$ a primitive $k$th root of unity, $P,Q,S\in\mathbb{K}[x]$ and $S$ has simple roots and degree coprime with $k$. Note $d$ the maximum of the degree of $P,Q,S$, $h$ the logarithmic height of the coefficients and $g$ the genus of $y^k-S(x)$. We present an algorithm which solves the elementary integration problem of $I$ generically in $O((kd)^{\omega+2g+1} h^{g+1})$ operations.

A note on correlation and local dimensions

2015

Abstract Under very mild assumptions, we give formulas for the correlation and local dimensions of measures on the limit set of a Moran construction by means of the data used to construct the set.

Characteristic Sturmian words are extremal for the Critical Factorization Theorem

2012

We prove that characteristic Sturmian words are extremal for the Critical Factorization Theorem (CFT) in the following sense. If p x ( n ) denotes the local period of an infinite word x at point n , we prove that x is a characteristic Sturmian word if and only if p x ( n ) is smaller than or equal to n + 1 for all n ≥ 1 and it is equal to n + 1 for infinitely many integers n . This result is extremal with respect to the \{CFT\} since a consequence of the \{CFT\} is that, for any infinite recurrent word x, either the function p x is bounded, and in such a case x is periodic, or p x ( n ) ≥ n + 1 for infinitely many integers n . As a byproduct of the techniques used in the paper we extend a r…

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…