Switching reconstruction and diophantine equations

AbstractBased on a result of R. P. Stanley (J. Combin. Theory Ser. B 38, 1985, 132–138) we show that for each s ≥ 4 there exists an integer Ns such that any graph with n > Ns vertices is reconstructible from the multiset of graphs obtained by switching of vertex subsets with s vertices, provided n ≠ 0 (mod 4) if s is odd. We also establish an analog of P. J. Kelly's lemma (Pacific J. Math., 1957, 961–968) for the above s-switching reconstruction problem

Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences

The concept of symbolic sequences play important role in study of complex systems. In the work we are interested in ultrametric structure of the set of cyclic sequences naturally arising in theory of dynamical systems. Aimed at construction of analytic and numerical methods for investigation of clusters we introduce operator language on the space of symbolic sequences and propose an approach based on wavelet analysis for study of the cluster hierarchy. The analytic power of the approach is demonstrated by derivation of a formula for counting of {\it two-fold de Bruijn sequences}, the extension of the notion of de Bruijn sequences. Possible advantages of the developed description is also discussed in context of applied

Integral zeroes of Krawtchouk polynomials

This thesis was submitted for the degree of Master of Philosophy and awarded by Brunel University.Krawtchouk polynomials appear in many various areas of mathematics starting from discrete mathematics (e.g., in coding theory), association schemes, and in the theory of graph representations. The existence/non-existence of integral zeroes of these polynomials is crucial for the existence/non-existence of combinatorial structures in the Hamming association schemes. The integer zeroes of Krawtchouk polynomials for k = 4; 5; 6 and 7 have been found using some very recent results on solvability of polynomial diophantine equations. Our aim is two-fold: Firstly, to verify these results using extensive computer calculations. This requires the solution of some of Pell’s equations and the use of the symbolic mathematics software mathematica. Secondly, we numerically investigate a conjecture dealing with the integer zeroes of the Krawtchouk polynomials Pm2 (m^2) (x) and provide confirmation of the conjecture using a combination of approaches up to m <= 1000, i.e., for the polynomials up to degree of about half a million

Gradual sub-lattice reduction and a new complexity for factoring polynomials

We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For such applications, the complexity of the algorithm improves traditional lattice reduction by replacing some dependence on the bit-length of the input vectors by some dependence on the bound for the output vectors. If the bit-length of the target vectors is unrelated to the bit-length of the input, then our algorithm is only linear in the bit-length of the input entries, which is an improvement over the quadratic complexity floating-point LLL algorithms. To illustrate the usefulness of this algorithm we show that a direct application to factoring univariate polynomials over the integers leads to the first complexity bound improvement since 1984. A second application is algebraic number reconstruction, where a new complexity bound is obtained as well

Control and stabilization of waves on 1-d networks

We present some recent results on control and stabilization of waves on 1-d networks.The fine time-evolution of solutions of wave equations on networks and, consequently, their control theoretical properties, depend in a subtle manner on the topology of the network under consideration and also on the number theoretical properties of the lengths of the strings entering in it. Therefore, the overall picture is quite complex.In this paper we summarize some of the existing results on the problem of controllability that, by classical duality arguments in control theory, can be reduced to that of observability of the adjoint uncontrolled system. The problem of observability refers to that of recovering the total energy of solutions by means of measurements made on some internal or external nodes of the network. They lead, by duality, to controllability results guaranteeing that L 2-controls located on those nodes may drive sufficiently smooth solutions to equilibrium at a final time. Most of our results in this context, obtained in collaboration with R. Dáger, refer to the problem of controlling the network from one single external node. It is, to some extent, the most complex situation since, obviously, increasing the number of controllers enhances the controllability properties of the system. Our methods of proof combine sidewise energy estimates (that in the particular case under consideration can be derived by simply applying the classical d'Alembert's formula), Fourier series representations, non-harmonic Fourier analysis, and number theoretical tools.These control results belong to the class of the so-called open-loop control systems.We then discuss the problem of closed-loop control or stabilization by feedback. We present a recent result, obtained in collaboration with J. Valein, showing that the observability results previously derived, regardless of the method of proof employed, can also be recast a posteriori in the context of stabilization, so to derive explicit decay rates (as) for the energy of smooth solutions. The decay rate depends in a very sensitive manner on the topology of the network and the number theoretical properties of the lengths of the strings entering in it.In the end of the article we also present some challenging open problems

Electrical Capacitance Volume Tomography Of High Contrast Dielectrics Using A Cuboid Geometry

An Electrical Capacitance Volume Tomography system has been created for use with a new image reconstruction algorithm capable of imaging high contrast dielectric distributions. The electrode geometry consists of two 4 x 4 parallel planes of copper conductors connected through custom built switch electronics to a commercially available capacitance to digital converter. Typical electrical capacitance tomography (ECT) systems rely solely on mutual capacitance readings to reconstruct images of dielectric distributions. This dissertation presents a method of reconstructing images of high contrast dielectric materials using only the self capacitance measurements. By constraining the unknown dielectric material to one of two values, the inverse problem is no longer ill-determined. Resolution becomes limited only by the accuracy and resolution of the measurement circuitry. Images were reconstructed using this method with both synthetic and real data acquired using an aluminum structure inserted at different positions within the sensing region. Comparisons with standard two dimensional ECT systems highlight the capabilities and limitations of the electronics and reconstruction algorithm

On the Reconstruction of Static and Dynamic Discrete Structures

We study inverse problems of reconstructing static and dynamic discrete structures from tomographic data (with a special focus on the `classical' task of reconstructing finite point sets in $\mathbb{R}^d$). The main emphasis is on recent mathematical developments and new applications, which emerge in scientific areas such as physics and materials science, but also in inner mathematical fields such as number theory, optimization, and imaging. Along with a concise introduction to the field of discrete tomography, we give pointers to related aspects of computerized tomography in order to contrast the worlds of continuous and discrete inverse problems