Applied Mathematics Commons^™

Bass’ Nk Groups And Cd H-Fibrant Hochschild Homology, G. Cortiñas, C. Haesemeyer, Mark E. Walker, C. Weibel

Department of Mathematics: Faculty Publications

The K-theory of a polynomial ring R[t ] contains the K-theory of R as a summand. For R commutative and containing Q, we describe K∗(R[t ])/K∗(R) in terms of Hochschild homology and the cohomology of Kähler differentials for the cdh topology.

We use this to address Bass’ question, whether K_n(R) = K_n(R[t ]) implies K_n(R) = K_n(R[t₁, t₂]). The answer to this question is affirmative when R is essentially of …

From Energy Gradient And Natural Selection To Biodiversity And Stability Of Ecosystems, Bo Deng

Department of Mathematics: Faculty Publications

The purpose of this paper is to incorporate well-established ecological principles into a foodweb model consisting of four trophic levels --- abiotic resources, plants, herbivores, and carnivores. The underlining principles include Kimura's neutral theory of genetic evolution, Liebig's Law of the Minimum for plant growth, Holling's functionals for herbivore foraging and carnivore predation, the One-Life Rule for all organisms, and Lotka-Volterra's model for intraand interspecific competitions. Numerical simulations of the model led to the following statistical findings: (a) particular foodwebs can give contradicting observations on biodiversity and productivity, in particular, all known functional forms -- - positive, negative, sigmoidal, and …

Generalized Fourier-Feynman Transforms, Convolution Products, And First Variations On Function Space, Seung Jun Chang, Jae Gil Choi, David Skough

Department of Mathematics: Faculty Publications

In this paper we examine the various relationships that exist among the first variation, the convolution product and the Fourier-Feynman transform for functionals of the form F(x) = f((α₁, x), . . . , (α_n, x)) with x in a very general function space C_a,b[0,T].

Population Coding Of Tone Stimuli In Auditory Cortex: Dynamic Rate Vector Analysis, Peter Bartho, Carina Curto, Artur Luczak, Stephan L. Marguet, Kenneth D. Harris

Department of Mathematics: Faculty Publications

Neural representations of even temporally unstructured stimuli can show complex temporal dynamics. In many systems, neuronal population codes show “progressive differentiation,” whereby population responses to different stimuli grow further apart during a stimulus presentation. Here we analyzed the response of auditory cortical populations in rats to extended tones. At onset (up to 300 ms), tone responses involved strong excitation of a large number of neurons; during sustained responses (after 500 ms) overall firing rate decreased, but most cells still showed a statistically significant difference in firing rate. Population vector trajectories evoked by different tone frequencies expanded rapidly along an initially …

Conceptual Circuit Models Of Neurons, Bo Deng

Department of Mathematics: Faculty Publications

A systematic circuit approach tomodel neurons with ion pump is presented here by which the voltage-gated current channels are modeled as conductors, the diffusion-induced current channels are modeled as negative resistors, and the one-way ion pumps are modeled as one-way inductors. The newly synthesized models are different from the type of models based on Hodgkin-Huxley (HH) approach which aggregates the electro, the diffusive, and the pump channels of each ion into one conductance channel. We show that our new models not only recover many known properties of the HH type models but also exhibit some new that cannot be extracted …

Connections Between Computation Trees And Graph Covers, Deanna Dreher, Judy L. Walker

Department of Mathematics: Faculty Publications

Connections between graph cover pseudocodewords and computation tree pseudocodewords are investigated with the aim of bridging the gap between the theoretically attractive analysis of graph covers and the more intractable analysis of iterative message-passing algorithms that are intuitively linked to graph covers. Both theoretical results and numerous examples are presented.

Analysis Of Connections Between Pseudocodewords, Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric T. Psota, Lance C. Pérez, Judy L. Walker

Department of Mathematics: Faculty Publications

The role of pseudocodewords in causing noncodeword outputs in linear programming (LP) decoding, graph cover decoding, and iterative message-passing decoding is investigated. The three main types of pseudocodewords in the literature — linear programming pseudocodewords, graph cover pseudocodewords, and computation tree pseudocodewords — are reviewed and connections between them are explored. Some discrepancies in the literature on minimal and irreducible pseudocodewords are highlighted and clarified, and a value for the minimal degree cover necessary to realize an LP pseudocodeword is found. Additionally, some conditions for the existence of connected realizations of graph cover pseudocodewords are given. This allows for further …

A Universal Theory Of Decoding And Pseudocodewords, Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric T. Psota, Lance C. Pérez, Judy L. Walker

Department of Mathematics: Faculty Publications

The discovery of turbo codes [5] and the subsequent rediscovery of low-density parity-check (LDPC) codes [9, 18] represent a major milestone in the field of coding theory. These two classes of codes can achieve realistic bit error rates, between 10−5 and 10−12, with signalto- noise ratios that are only slightly above the minimum possible for a given channel and code rate established by Shannon’s original capacity theorems. In this sense, these codes are said to be near-capacity-achieving codes and are sometimes considered to have solved (in the engineering sense, at least) the coding problem for the additive white Gaussian noise …

Nonbinary Quantum Error-Correcting Codes From Algebraic Curves, Jon-Lark Kim, Judy L. Walker

Department of Mathematics: Faculty Publications

We give a generalized CSS construction for nonbinary quantum error-correcting codes. Using this we construct nonbinary quantum stabilizer codes from algebraic curves. We also give asymptotically good nonbinary quantum codes from a Garcia- Stichtenoth tower of function fields which are constructible in polynomial time.

Binary quantum error-correcting codes have been constructed in several ways. One interesting construction uses algebraic-geometry codes [2], [6], [7], [12], with the main idea being to apply the binary CSS construction [4], [5], [16] to the asymptotically good algebraic-geometry codes arising from the Garcia-Stichtenoth [11] tower of function fields over F_q2 (where q is a …

Local Cohomology And Support For Triangulated Categories, Dave Benson, Srikanth Iyengar, Henning Krause

Department of Mathematics: Faculty Publications

We propose a new method for defining a notion of support for objects in any compactly generated triangulated category admitting small coproducts. This approach is based on a construction of local cohomology functors on triangulated categories, with respect to a central ring of operators. Suitably specialized one recovers, for example, the theory for commutative noetherian rings due to Foxby and Neeman, the theory of Avramov and Buchweitz for complete intersection local rings, and varieties for representations of finite groups according to Benson, Carlson, and Rickard. We give explicit examples of objects whose triangulated support and cohomological support differ. In the …

Towards Universal Cover Decoding, Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric T. Psota, Lance C. Pérez, Judy L. Walker

Department of Mathematics: Faculty Publications

Low complexity decoding of low-density paritycheck (LDPC) codes may be obtained from the application of iterative message-passing decoding algorithms to the bipartite Tanner graph of the code. Arguably, the two most important decoding algorithms for LDPC codes are the sum-product decoder and the min-sum (MS) decoder. On a bipartite graph without cycles (a tree), the sum-product decoder minimizes the probability of bit error, while the min-sum decoder minimizes the probability of word error [9]. While the behavior of sum-product and min-sum is easily understood when operating on trees, their behavior becomes much more difficult to characterize when the Tanner graph …

Ldpc Codes From Voltage Graphs, Christine A. Kelley, Judy L. Walker

Department of Mathematics: Faculty Publications

Several well-known structure-based constructions of LDPC codes, for example codes based on permutation and circulant matrices and in particular, quasi-cyclic LDPC codes, can be interpreted via algebraic voltage assignments. We explain this connection and show how this idea from topological graph theory can be used to give simple proofs of many known properties of these codes. In addition, the notion of abelianinevitable cycle is introduced and the subgraphs giving rise to these cycles are classified. We also indicate how, by using more sophisticated voltage assignments, new classes of good LDPC codes may be obtained.

Average Min-Sum Decoding Of Ldpc Codes, Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric T. Psota, Lance C. Pérez, Judy L. Walker

Department of Mathematics: Faculty Publications

Simulations have shown that the outputs of minsum (MS) decoding generally behave in one of two ways: the output either eventually stabilizes at a codeword or eventually cycles through a finite set of vectors that may include both codewords and non-codewords. This inconsistency in MS across iterations has significantly contributed to the difficulty in studying the performance of this decoder. To overcome this problem, a new decoder, average min-sum (AMS), is proposed; this decoder outputs the average of the min-sum output vectors over a finite set of iterations. Simulations comparing MS, AMS, linear programming (LP) decoding, and maximum likelihood (ML) …

A Universal Theory Of Pseudocodewords, Nathan Axvig, Emily Price, Eric T. Psota, Deanna Turk, Lance C. Pérez, Judy L. Walker

Department of Mathematics: Faculty Publications

Three types of pseudocodewords for LDPC codes are found in the literature: graph cover pseudocodewords, linear programming pseudocodewords, and computation tree pseudocodewords. In this paper we first review these three notions and known connections between them. We then propose a new decoding rule — universal cover decoding — for LDPC codes. This new decoding rule also has a notion of pseudocodeword attached, and this fourth notion provides a framework in which we can better understand the other three.

Mathematical Analysis Of Pde Systems Which Govern °Uid Structure Interactive Phenomena, George Avalos, Roberto Triggiani

Department of Mathematics: Faculty Publications

In this paper, we review and comment upon recently derived results for time dependent partial differential equation (PDE) models, which have been used to describe the various fluid-structure interactions which occur in nature. For these fluid-structure PDEs, this survey is particularly focused on the authors' results of (i) semigroup wellposedness, (ii) stability, and (iii) backward uniqueness.

The Time Invariance Principle, Ecological (Non)Chaos, And A Fundamental Pitfall Of Discrete Modeling, Bo Deng

Department of Mathematics: Faculty Publications

This paper is to show that most discrete models used for population dynamics in ecology are inherently pathological that their predications cannot be independently verified by experiments because they violate a fundamental principle of physics. The result is used to tackle an on-going controversy regarding ecological chaos. Another implication of the result is that all continuous dynamical systems must be modeled by differential equations. As a result it suggests that researches based on discrete modeling must be closely scrutinized and the teaching of calculus and differential equations must be emphasized for students of biology.

The Origin Of 2 Sexes Through Optimization Of Recombination Entropy Against Time And Energy, Bo Deng

Department of Mathematics: Faculty Publications

Sexual reproduction in nature requires two sexes, which raises the question why the reproductive scheme did not evolve to have three or more sexes. Here we construct a constrained optimization model based on the communication theory to analyze trade-offs among reproductive schemes with arbitrary number of sexes. More sexes on one hand lead to higher reproductive diversity, but on the other hand incur greater cost in time and energy for reproductive success. Our model shows that the two-sexes reproduction scheme maximizes the recombination entropy-to-cost ratio, and hence is the optimal solution to the problem.

S-Extremal Additive F4 Codes, Evangeline P. Bautista, Philippe Gaborit, Jon-Lark Kim, Judy L. Walker

Department of Mathematics: Faculty Publications

Binary self-dual codes and additive self-dual codes over F₄ have in common interesting properties, for example, Type I, Type II, shadows, etc. Recently Bachoc and Gaborit introduced the notion of s-extremality for binary self-dual codes, generalizing Elkies' study on the highest possible minimum weight of the shadows of binary self-dual codes. In this paper, we introduce a concept of s-extremality for additive self-dual codes over F₄, give a bound on the length of these codes with even distance d, classify them up to minimum distance d = 4, give possible lengths and (shadow) weight …

Characterizations Of Pseudo-Codewords Of Ldpc Codes, Ralf Koetter, Wen-Cheng W. Li, Pascal O. Vontobel, Judy L. Walker

Department of Mathematics: Faculty Publications

An important property of high-performance, low complexity codes is the existence of highly efficient algorithms for their decoding. Many of the most efficient, recent graph-based algorithms, e.g. message passing algorithms and decoding based on linear programming, crucially depend on the efficient representation of a code in a graphical model. In order to understand the performance of these algorithms, we argue for the characterization of codes in terms of a so called fundamental cone in Euclidean space which is a function of a given parity check matrix of a code, rather than of the code itself. We give a number of …

Norming Algebras And Automatic Complete Boundedness Of Isomorphisms Of Operator Algebras, David R. Pitts

Department of Mathematics: Faculty Publications

We combine the notion of norming algebra introduced by Pop, Sinclair and Smith with a result of Pisier to show that if A1 and A2 are operator algebras, then any bounded epimorphism of A1 onto A2 is completely bounded provided that A2 contains a norming C*-subalgebra. We use this result to give some insights into Kadison’s Similarity Problem: we show that every faithful bounded homomorphism of a C*-algebra on a Hilbert space has completely bounded inverse, and show that a bounded representation of a C-algebra is similar to a -representation precisely when the image operator algebra -norms itself. We give …

Why Is The Number Of Dna Bases 4?, Bo Deng

Department of Mathematics: Faculty Publications

In this paper we construct a mathematical model for DNA replication based on Shannon’s mathematical theory for communication. We treatDNAreplication as a communication channel. We show that the mean replication rate is maximal with four nucleotide bases under the primary assumption that the pairing time of the G–C bases is between 1.65 and 3 times the pairing time of the A–T bases.

Coordinate Systems And Bounded Isomorphisms, David R. Pitts, David R. Pitts

Department of Mathematics: Faculty Publications

For a Banach D-bimoduleMover an abelian unital C*-algebraD, we define E1(M) as the collection of norm-one eigenvectors for the dual action of D on the Banach space dual M#. Equip E1(M) with the weak*-topology. We develop general properties of E1(M). It is properly viewed as a coordinate system for M when M C, where C is a unital C*-algebra containing D as a regular MASA with the extension property; moreover, E1(C) coincides with Kumjian’s twist in the context of C*-diagonals. We identify the C*-envelope of a subalgebra A of a C*-diagonal when D A C. For triangular subalgebras, each containing …

Weak Solutions To The Cauchy Problem Of A Semilinear Wave Equation With Damping And Source Terms, Petronela Radu

Department of Mathematics: Faculty Publications

In this paper we prove local existence of weak solutions for a semilinear wave equation with power-like source and dissipative terms on the entire space ℝⁿ. The main theorem gives an alternative proof of the local in time existence result due to J. Serrin, G. Todorova and E. Vitillaro, and also some extension to their work. In particular, our method shows that sources that are not locally Lipschitz in L² can be controlled without any damping at all. If the semilinearity involving the displacement has a “good” sign, we obtain global existence of solutions.

Reversals And Transpositions Over Finite Alphabets, A. J. Radcliffe, A. D. Scott, E. L. Wilmer

Department of Mathematics: Faculty Publications

Extending results of Christie and Irving, we examine the action of reversals and transpositions on finite strings over an alphabet of size k. We show that determining reversal, transposition, or signed reversal distance between two strings over a finite alphabet is NP-hard, while for “dense” instances we give a polynomial-time approximation scheme. We also give a number of extremal results, as well as investigating the distance between random strings and the problem of sorting a string over a finite alphabet.

Absolutely Continuous Representations And A Kaplansky Density Theorem For Free Semigroup Algebras, Kenneth R. Davidson, Jiankui Li, David R. Pitts

Department of Mathematics: Faculty Publications

We introduce notions of absolutely continuous functionals and representations on the non-commutative disk algebra An. Absolutely continuous functionals are used to help identify the type L part of the free semigroup algebra associated to a ∗-extendible represen- tation . A ∗-extendible representation of An is regular if the absolutely continuous part coincides with the type L part. All known examples are regular. Absolutely continuous func- tionals are intimately related to maps which intertwine a given ∗-extendible representation with the left regular representation. A simple application of these ideas extends reflexivity and hyper-reflexivity results. Moreover the use of absolute continuity is …

Integral Transforms, Convolution Products, And First Variations, Bong Jin Kim, Byoung Soo Kim, David Skough

Department of Mathematics: Faculty Publications

We establish the various relationships that exist among the integral transform F_α,βF, the convolution product (F∗G)α, and the first variation δF for a class of functionals defined on K[0,T], the space of complex-valued continuous functions on [0,T] which vanish at zero.

A Survey Of Results Involving Transforms And Convolutions In Function Space, David Skough, David Storvick

Department of Mathematics: Faculty Publications

In this paper we survey various results involving Fourier-Wiener transforms, Fourier-Feynman transforms, integral transforms and convolution products of functionals over function space that have been established since Cameron and Martin first introduced Fourier-Wiener transforms in 1945.

Applications Of List Decoding To Tracing Traitors, Alice Silverberg, Jessica Staddon, Judy L. Walker

Department of Mathematics: Faculty Publications

We apply results from algebraic coding theory to solve problems in cryptography, by using recent results on list decoding of error-correcting codes to efficiently find traitors who collude to create pirates. We produce schemes for which the TA (traceability) traitor tracing algorithm is very fast. We compare the TA and IPP (identifiable parent property) traitor tracing algorithms, and give evidence that when using an algebraic structure, the ability to trace traitors with the IPP algorithm implies the ability to trace with the TA algorithm. We also demonstrate that list decoding techniques can be used to find all possible pirate coalitions. …

Homogeneous Weights And Exponential Sums, José Felipe Voloch, Judy L. Walker

Department of Mathematics: Faculty Publications

In this paper, we give a formula as an exponential sum for a homogeneous weight defined by Constantinescu and Heise [3] in the case of Galois rings (or equivalently, rings of Witt vectors) and use this formula to estimate the weight of codes obtained from algebraic geometric codes over rings.

Finite Subsets Of The Plane Are 18-Reconstructible, L. Pebody, A. J. Radcliffe, A. D. Scott

Department of Mathematics: Faculty Publications

We prove that every finite subset of the plane is reconstructible from the multiset of its subsets of at most 18 points, each given up to rigid motion. We also give some results concerning the reconstructibility of infinite subsets of the plane.