Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

2008

Selected Works

PDF

Discipline
Institution
Keyword
Publication

Articles 1 - 15 of 15

Full-Text Articles in Mathematics

Asymptotic Behavior Of Linearized Viscoelastic Flow Problem, Yinnian He, Yi Li Nov 2008

Asymptotic Behavior Of Linearized Viscoelastic Flow Problem, Yinnian He, Yi Li

Yi Li

In this article, we provide some asymptotic behaviors of linearized viscoelastic flows in a general two-dimensional domain with certain parameters small and the time variable large.


Analysis On The Strip-Based Projection Model For Discrete Tomography, Jiehua Zhu, Xiezhang Li, Yangbo Ye, Ge Wang Jun 2008

Analysis On The Strip-Based Projection Model For Discrete Tomography, Jiehua Zhu, Xiezhang Li, Yangbo Ye, Ge Wang

Xiezhang Li

Discrete tomography deals with image reconstruction of an object with finitely many gray levels (such as two). Different approaches are used to model the raw detector reading. The most popular models are line projection with a lattice of points and strip projection with a lattice of pixels/cells. The line-based projection model fits some applications but involves a major approximation since the x-ray beams of finite widths are simplified as line integrals. The strip-based projection model formulates projection equations according to the fractional areas of the intersection of each strip-shaped beam and the rectangular grid of an image to be reconstructed, …


A Note On Mustata's Computation Of Multiplier Ideals Of Hyperplane Arrangements, Zach Teitler May 2008

A Note On Mustata's Computation Of Multiplier Ideals Of Hyperplane Arrangements, Zach Teitler

Zach Teitler

In 2006, M. Mustata used jet schemes to compute the multiplier ideals of reduced hyperplane arrangements. We give a simpler proof using a log resolution and generalize to non-reduced arrangements. By applying the idea of wonderful models introduced by De Concini–Procesi in 1995, we also simplify the result. Indeed, Mustat¸˘a’s result expresses the multiplier ideal as an intersection, and our result uses (generally) fewer terms in the intersection.


An Improved Multi-Set Algorithm For The Dense Subset Sum Problem, Andrew Shallue Apr 2008

An Improved Multi-Set Algorithm For The Dense Subset Sum Problem, Andrew Shallue

Andrew Shallue

No abstract provided.


Percentage-Based Versus Power-Based Vote Tabulation Statistical Audits, John Mccarthy, Howard Stanislevic, Mark Lindeman, Arlene S. Ash, Vittorio Addona, Mary Batcher Feb 2008

Percentage-Based Versus Power-Based Vote Tabulation Statistical Audits, John Mccarthy, Howard Stanislevic, Mark Lindeman, Arlene S. Ash, Vittorio Addona, Mary Batcher

Vittorio Addona

An audit model is presented to address inefficient percentage-based election audits. Presented to state and local election officials and legislators.


C^1 Actions Of The Mapping Class Group On The Circle, Kamlesh Parwani Jan 2008

C^1 Actions Of The Mapping Class Group On The Circle, Kamlesh Parwani

Kamlesh Parwani

Let S be a connected orientable surface with finitely many punctures, finitely many boundary components, and genus at least 6. Then any C^1 action of the mapping class group of S on the circle is trivial. The techniques used in the proof of this result permit us to show that products of Kazhdan groups and certain lattices cannot have C^1 faithful actions on the circle. We also prove that for n > 5, any C^1 action of Aut(F_n) or Out(F_n) on the circle factors through an action of Z/2Z.


The Two Variable Substitution Problem For Free Products Of Groups, Leo P. Comerford, Charles C. Edmunds Jan 2008

The Two Variable Substitution Problem For Free Products Of Groups, Leo P. Comerford, Charles C. Edmunds

Leo Comerford

We consider equations of the form W(x,y) = U with U an element of a free product G of groups. We show that with suitable algorithmic conditions on the free factors of G, one can effectively determine whether or not the equations have solutions in G. We also show that under certain hypotheses on the free factors of G and the equation itself, the equation W(x,y) = U has only finitely many solutions, up to the action of the stabilizer of W(x,y) in Aut().


Double Cross Playing Diamonds, Rudolf Kaehr Jan 2008

Double Cross Playing Diamonds, Rudolf Kaehr

Rudolf Kaehr

Understanding interactivity in/between bigraphs and diamonds Grammatologically, the Western notational system is not offering space in itself to place sameness and otherness necessary to realize interaction/ality. Alphabetism is not prepared to challenge the dynamics of interaction directly. The Chinese writing system in its scriptural structuration, is able to place complex differences into itself, necessary for the development and design of formal systems and programming languages of interaction. The challenge of interactionality to Western thinking, modeling and design interactivity has to be confronted with the decline of the scientific power of alpha-numeric notational systems as media of living in a complex …


Short Studies 2008. Adventures In Diamond Strategies Of Change(S), Rudolf Kaehr Jan 2008

Short Studies 2008. Adventures In Diamond Strategies Of Change(S), Rudolf Kaehr

Rudolf Kaehr

Modular Bolognese Paradoxes of postmodern education. A Tale of Fishes, Birds and Diamonds in Second-Order Epistemology Why it is useless to write about the mono-contexturality of alphabetism and digitalism Chez Maxime's Human rights in a polycontextural world Primary Thoughts to a Manifesto for Awareness Fashion Marketing Which Equality? How equal are equal human beings? Generalized Diamonds From monosemic to tectonic complementarity Diamond Disremption Diamond interpretation of the kenomic succession operation Diamond Web2.0? How social is social networking? Web Mobility Web computing between semiotic and kenomic spaces Double Cross Playing Diamonds Understanding interactivity in/between bigraphs and diamonds Morphogrammatics of Change A …


The Adaptability Principle Of Mechanical Law And The Scale-Invariant Principle Of Mechanical Law In Fractal Space, Yang Xiaojun Jan 2008

The Adaptability Principle Of Mechanical Law And The Scale-Invariant Principle Of Mechanical Law In Fractal Space, Yang Xiaojun

Xiao-Jun Yang

The adaptability principle of mechanical law and the scale-invariant principle of mechanical law in fractal space are proved by using parameter-space and scale-space transforms in renormalization groups.From the space-transform angle,the transform of mechanical law from fractal space to European space is the scale-invariant transform while the transform of mechanical law from European space to fractal space is the adaptability transform.Their deductions are that law of conservation of energy and vectorial resultant of force and displacement in fractal space hold the line in form and Carpinteri's dimensional formula of fractal space is also proved. Namely,the spilling dimension of volume in fractal …


Fractional Definite Integral, Yang Xiaojun Jan 2008

Fractional Definite Integral, Yang Xiaojun

Xiao-Jun Yang

Fractional definite integral is that a value of the integral calculus over given interva1.Under the circumstance of fractional dimension,fractional definite integral is important to compute some value in given interva1.It is complied with starting introducing definition,the properties,leads into fractional integral function of definition and the properties,and then induces to basic theorems for fractional integral calculus


Highly Connected Multicoloured Subgraphs Of Multicoloured Graphs, H. Liu, R. Morris, N. Prince Dec 2007

Highly Connected Multicoloured Subgraphs Of Multicoloured Graphs, H. Liu, R. Morris, N. Prince

Noah Prince

Suppose the edges of the complete graph on n vertices, E(Kn), are coloured using r colours; how large a k-connected subgraph are we guaranteed to find, which uses only at most s of the colours? This question is due to Bollobás, and the case s=1 was considered in Liu et al. [Highly connected monochromatic subgraphs of multicoloured graphs, J. Graph Theory, to appear]. Here we shall consider the case s is greater than or equal to 2, proving in particular that when s=2 and r+1 is a power of 2 then the answer lies between 4n/(r+1)-17kr(r+2k+1) and 4n/(r+1)+4 and that …


On KS,T-Minors In Graphs With Given Average Degree, A. V. Kostochka, N. Prince Dec 2007

On KS,T-Minors In Graphs With Given Average Degree, A. V. Kostochka, N. Prince

Noah Prince

Let D(H) be the minimum d such that every graph G with average degree d has an H-minor. Myers and Thomason found good bounds on D(H) for almost all graphs H and proved that for 'balanced' H random graphs provide extremal examples and determine the extremal function. Examples of 'unbalanced graphs' are complete bipartite graphs Ks,t for a fixed s and large t. Myers proved upper bounds on D(Ks,t ) and made a conjecture on the order of magnitude of D(Ks,t ) for a fixed s and …


Padé Spline Functions, Tian-Xiao He Dec 2007

Padé Spline Functions, Tian-Xiao He

Tian-Xiao He

We present here the definition of Pad´e spline functions, their expressions, and the estimate of the remainders of pad´e spline expansions. Some algorithms are also given.


Thermal Roots Of Correlation-Based Complexity, Philip Fraundorf Dec 2007

Thermal Roots Of Correlation-Based Complexity, Philip Fraundorf

Phil Fraundorf

Bayesian maxent lets one integrate thermal physics and information theory points of view in the quantitative study of complex systems. Since net surprisal (a free energy analog for measuring “departures from expected”) allows one to place second law constraints on mutual information (a multimoment measure of correlations), it makes a quantitative case for the role of reversible thermalization in the natural history of invention, and suggests multiscale strategies to monitor standing crop as well. It prompts one to track evolved complexity starting from live astrophysically observed processes, rather than only from evidence of past events. Various gradients and boundaries that …