Explosive Hyperinflation, Inflation Tax Laffer Curve and Modelling the use of Money

This paper analyzes the existence of an inflation tax Laffer curve (ITLC) in the context of two standard optimizing monetary models: a cash-in-advance model and a money in the utility function model. Agents’ preferences are characterized in the two models by a constant relative risk aversion utility function. Explosive hyperinflation rules out the presence of an ITLC. In the context of a cash-in-advance economy, this paper shows that explosive hyperinflation is feasible and thus an ITLC is ruled out whenever the relative risk aversion parameter is greater than one. In the context of an optimizing model with money in the utility function, this paper firstly shows that an ITLC is ruled out. Moreover, it is shown that explosive hyperinflations are more likely when the transactions role of money is more important. However, hyperinflationary paths are not feasible in this context unless certain restrictions are imposed.

Is there a Phillips Curve in the US and the EU15 Countries? An empirical investigation

This paper studies the comovement between output and inflation in the EU15 countries. Following den Haan (2000), I use the correlations of VAR forecast errors at different horizons in order to analyze the output-inflation relationship. The empirical results show that eight countries display a significant positive comovement between output and inflation. Moreover, the empirical evidence suggests that a Phillips curve phenomenom is more likely to be detected in countries where inflation is more stable.

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction

23 p. -- An extended abstract of this work appears in the proceedings of the 2012 ACM/IEEE Symposium on Logic in Computer Science

Diagonal forms, linear algebraic methods and Ramsey-type problems

This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M. Wilson and the author find the general formula for the Smith normal form or diagonal form of N_t(H) for all simple graphs H and for a very general class of t-uniform hypergraphs H.

As a continuation, the author determines the formula for diagonal forms of integer matrices obtained from other combinatorial structures, including incidence matrices for subgraphs of a complete bipartite graph and inclusion matrices for multisets.

One major application of diagonal forms is in zero-sum Ramsey theory. For instance, Caro's results in zero-sum Ramsey numbers for graphs and Caro and Yuster's results in zero-sum bipartite Ramsey numbers can be reproduced. These results are further generalized to t-uniform hypergraphs. Other applications include signed bipartite graph designs.

Research results on some other problems are also included in this thesis, such as a Ramsey-type problem on equipartitions, Hartman's conjecture on large sets of designs and a matroid theory problem proposed by Welsh.

Algebraic Techniques in Coding Theory: Entropy Vectors, Frames, and Constrained Coding

The study of codes, classically motivated by the need to communicate information reliably in the presence of error, has found new life in fields as diverse as network communication, distributed storage of data, and even has connections to the design of linear measurements used in compressive sensing. But in all contexts, a code typically involves exploiting the algebraic or geometric structure underlying an application. In this thesis, we examine several problems in coding theory, and try to gain some insight into the algebraic structure behind them.

The first is the study of the entropy region - the space of all possible vectors of joint entropies which can arise from a set of discrete random variables. Understanding this region is essentially the key to optimizing network codes for a given network. To this end, we employ a group-theoretic method of constructing random variables producing so-called "group-characterizable" entropy vectors, which are capable of approximating any point in the entropy region. We show how small groups can be used to produce entropy vectors which violate the Ingleton inequality, a fundamental bound on entropy vectors arising from the random variables involved in linear network codes. We discuss the suitability of these groups to design codes for networks which could potentially outperform linear coding.

The second topic we discuss is the design of frames with low coherence, closely related to finding spherical codes in which the codewords are unit vectors spaced out around the unit sphere so as to minimize the magnitudes of their mutual inner products. We show how to build frames by selecting a cleverly chosen set of representations of a finite group to produce a "group code" as described by Slepian decades ago. We go on to reinterpret our method as selecting a subset of rows of a group Fourier matrix, allowing us to study and bound our frames' coherences using character theory. We discuss the usefulness of our frames in sparse signal recovery using linear measurements.

The final problem we investigate is that of coding with constraints, most recently motivated by the demand for ways to encode large amounts of data using error-correcting codes so that any small loss can be recovered from a small set of surviving data. Most often, this involves using a systematic linear error-correcting code in which each parity symbol is constrained to be a function of some subset of the message symbols. We derive bounds on the minimum distance of such a code based on its constraints, and characterize when these bounds can be achieved using subcodes of Reed-Solomon codes.

Estimation of the growth curve parameters in Macrobrachium rosenbergii

Growth is one of the most important characteristics of cultured species. The objective of this study was to determine the fitness of linear, log linear, polynomial, exponential and Logistic functions to the growth curves of Macrobrachium rosenbergii obtained by using weekly records of live weight, total length, head length, claw length, and last segment length from 20 to 192 days of age. The models were evaluated according to the coefficient of determination (R2), and error sum off square (ESS) and helps in formulating breeders in selective breeding programs. Twenty full-sib families consisting 400 PLs each were stocked in 20 different hapas and reared till 8 weeks after which a total of 1200 animals were transferred to earthen ponds and reared up to 192 days. The R2 values of the models ranged from 56 – 96 in case of overall body weight with logistic model being the highest. The R2 value for total length ranged from 62 to 90 with logistic model being the highest. In case of head length, the R2 value ranged between 55 and 95 with logistic model being the highest. The R2 value for claw length ranged from 44 to 94 with logistic model being the highest. For last segment length, R2 value ranged from 55 – 80 with polynomial model being the highest. However, the log linear model registered low ESS value followed by linear model for overall body weight while exponential model showed low ESS value followed by log linear model in case of head length. For total length the low ESS value was given by log linear model followed by logistic model and for claw length exponential model showed low ESS value followed by log linear model. In case of last segment length, linear model showed lowest ESS value followed by log linear model. Since, the model that shows highest R2 value with low ESS value is generally considered as the best fit model. Among the five models tested, logistic model, log linear model and linear models were found to be the best models for overall body weight, total length and head length respectively. For claw length and last segment length, log linear model was found to be the best model. These models can be used to predict growth rates in M. rosenbergii. However, further studies need to be conducted with more growth traits taken into consideration

Directional algebraic reconstruction technique for electrical impedance tomography

We assume that the resistance matrix can be found in electrical impedance tomography from the assumption of linear dependence between the voltages and the currents and with the help of the resistance matrix and the transfer impedance between the electrodes, a directional algebraic reconstruction technique is proposed. The goal is to reconstruct the resistivity distribution by weighting the matrices that are obtained by calculating the orthogonal distance of the underlying mesh elements from the neighbouring port resistivity lines. These weighting matrices, which only depend on the topology of the underlying mesh, can be calculated offline and result in a computationally efficient online procedure with a reasonable image reconstruction performance. Simulation results are provided to validate this approach.

The von Bertalanffy growth curve: when a good fit is not good enough

The von Bertalanffy growth function is used for length based analysis of growth and mortality patterns for management of fisheries. However, certain fish have growth patterns that the VBGF may not be able to describe adequately.e.g. the Acanthurus lineatus in Samoa. In such cases a two phase VBGF may be a useful approach.