Finding the conductors in circular networks from boundary measurements
Finding the roots of polynomial equations: an algorithm with linear command.
We show how an old principle, due to Walsh (1922), can be used in order to construct an algorithm which finds the roots of polynomials with complex coefficients. This algorithm uses a linear command. From the very first step, the zero is located inside a disk, so several zeros can be searched at the same time.
Finding Tricyclic Graphs with a Maximal Number of Matchings - Another Example of Computer Aided Research in Graph Theory
Finding vertex-disjoint cycle cover of undirected graph using the least-squares method
We investigate the properties of the least-squares solution of the system of equations with a matrix being the incidence matrix of a given undirected connected graph and we propose an algorithm that uses this solution for finding a vertex-disjoint cycle cover (2-factor) of the graph .
Finite abelian groups and factorization problems
Finite abelian groups and factorization problems. II
Finite C3 Geometries in Which All Lines Are Thin.
Finite canonization
The canonization theorem says that for given for some (the first one is called ) we have for every function with domain , for some , the question of when the equality (where and are from ) holds has the simplest answer: for some the equality holds iff . We improve the bound on so that fixing the number of exponentiation needed to calculate is best possible.
Finite commutative monoids of open maps
Finite Coverings by Translates of Centrally Symmetric Convex Domains.
Finite geometries, varieties and codes.
Finite graphs and digraphs which are not reconstructible from their cardinality restricted subgraphs
Finite linear spaces with two more lines than points.
Finite line-transitive linear spaces: Parameters and normal point-partitions.
Finite mutation classes of coloured quivers
We show that the mutation class of a coloured quiver arising from an m-cluster tilting object associated with a finite-dimensional hereditary algebra H, is finite if and only if H is of finite or tame representation type, or it has at most two simples. This generalizes a result known for cluster categories.
Finite nondense point set analysis
The paper deals with the decomposition and with the boundarz and hull construction of the so-called nondense point set. This problem and its applications have been frequently studied in computational geometry, raster graphics and, in particular, in the image processing (see e.g. [3], [6], [7], [8], [9], [10]). We solve a problem of the point set decomposition by means of certain relations in graph theory.
Finite planar vertex-transitive graphs of the regularity degree three
Finite projective planes, Fermat curves, and Gaussian periods
One of the oldest and most fundamental problems in the theory of finite projective planes is to classify those having a group which acts transitively on the incident point-line pairs (flags). The conjecture is that the only ones are the Desarguesian projective planes (over a finite field). In this paper, we show that non-Desarguesian finite flag-transitive projective planes exist if and only if certain Fermat surfaces have no nontrivial rational points, and formulate several other equivalences involving...
Finite Rogers-Ramanujan type identities.
Finite simple groups of Lie type as expanders
We prove that all finite simple groups of Lie type, with the exception of the Suzuki groups, can be made into a family of expanders in a uniform way. This confirms a conjecture of Babai, Kantor and Lubotzky from 1989, which has already been proved by Kassabov for sufficiently large rank. The bounded rank case is deduced here from a uniform result for which is obtained by combining results of Selberg and Drinfeld via an explicit construction of Ramanujan graphs by Lubotzky, Samuels and Vishne.