Analogues of up-down permutations for colored permutations.
Analyse hiérarchique des préférences et généralisations de la transitivité
Analysis of a class of graph partitioning problems
Analysis of an algorithm to construct Fibonacci partitions
Analysis of an asymmetric leader election algorithm.
Analysis of PBIB Designs Using Association Matrices.
Analysis of Space-Temporal Symmetry in the Early Embryogenesis of Calla palustris L., Araceae
Plants and animals have highly ordered structure both in time and in space, and one of the main questions of modern developmental biology is the transformation of genetic information into the regular structure of organism. Any multicellular plant begins its development from the universal unicellular state and acquire own species-specific structure in the course of cell divisions, cell growth and death, according to own developmental program. However the cellular mechanisms of plant development are...
Analysis of straightening formula.
Analytic aspects of the circulant Hadamard conjecture
We investigate the problem of counting the real or complex Hadamard matrices which are circulant, by using analytic methods. Our main observation is the fact that for the quantity satisfies , with equality if and only if is the eigenvalue vector of a rescaled circulant complex Hadamard matrix. This suggests three analytic problems, namely: (1) the brute-force minimization of , (2) the study of the critical points of , and (3) the computation of the moments of . We explore here these questions,...
Analytic Formulas for Full Steiner Trees.
Analytical enumeration of circulant graphs with prime-squared number of vertices.
Analyzing sets of phylogenetic trees using metrics
The reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationships between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we describe a general method for comparing phylogenetic trees and give some basic properties of the Matching Split metric, which...
Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view
To model the dynamics of discrete deterministic systems, we extend the Petri nets framework by a priority relation between conflicting transitions, which is encoded by orienting the edges of a transition conflict graph. The aim of this paper is to gain some insight into the structure of this conflict graph and to characterize a class of suitable orientations by an analysis in the context of hypergraph theory.
Animals and 2-Motzkin paths.
Announcements of new results
Another abstraction of the Erdős-Szekeres happy end theorem.
Another case of the prime power conjecture for finite projective planes.
Another characterisation of planar graphs.
Another class of equienergetic graphs
Another infinite sequence of dense triangle-free graphs.