Physical Sciences and Mathematics Commons^™

The Maximum Rectilinear Crossing Number Of The Wheel Graph, Elie Feder

Publications and Research

We find and prove the maximum rectilinear crossing number of the wheel graph. First, we illustrate a picture of the wheel graph with many crossings to prove a lower bound. We then prove that this bound is sharp. The treatment is divided into two cases for n even and n odd.

Graphs Of Bounded Degree And The P-Harmonic Boundary, Michael J. Puls

Publications and Research

Let p be a real number greater than one and let G be a connected graph of bounded degree. We introduce the p-harmonic boundary of G and use it to characterize the graphs G for which the constant functions are the only p-harmonic functions on G. We show that any continuous function on the p-harmonic boundary of G can be extended to a function that is p-harmonic on G. We also give some properties of this boundary that are preserved under rough-isometries. Now let Gamma be a finitely generated group. As an application of our results, we characterize the vanishing …

Multiresolution Inverse Wavelet Reconstruction From A Fourier Partial Sum, Nataniel Greene

Publications and Research

The Gibbs phenomenon refers to the lack of uniform convergence which occurs in many orthogonal basis approximations to piecewise smooth functions. This lack of uniform convergence manifests itself in spurious oscillations near the points of discontinuity and a low order of convergence away from the discontinuities.In previous work [11,12] we described a numerical procedure for overcoming the Gibbs phenomenon called the Inverse Wavelet Reconstruction method (IWR). The method takes the Fourier coefficients of an oscillatory partial sum and uses them to construct the wavelet coefficients of a non-oscillatory wavelet series. However, we only described the method standard wavelet series and …

The Maximum Rectilinear Crossing Number Of The Petersen Graph, Elie Feder, Heiko Harborth, Steven Herzberg, Sheldon Klein

Publications and Research

We prove that the maximum rectilinear crossing number of the Petersen graph is 49. First, we illustrate a picture of the Petersen graph with 49 crossings to prove the lower bound. We then prove that this bound is sharp by carefully analyzing the ten Cs's which occur in the Petersen graph and their properties.

The Maximum Rectilinear Crossing Number Of The N Dimensional Cube Graph, Matthew Alpert, Elie Feder, Heiko Harborth, Sheldon Klein

Publications and Research

We find a.nd prove the maximum rectilinear crossing n1.1mber of the three-dimensional cube graph (Q₃). We demonstrate a method of drawing then-cube graph, Q_n., with many crossings, and thus find a lower bound for the maximum rectilinear crossing number of Q_n. We conjecture that this bound is sharp. We also prove an upper bound for the maximum rectilinear crossing number of Q_n.

Series That Probably Converge To One, Thomas J. Pfaff, Max Tran

Publications and Research

No abstract provided.

The Maximum Of The Maximum Rectilinear Crossing Numbers Of D-Regular Graphs Of Order N, Matthew Alpert, Elie Feder, Heiko Harborth

Publications and Research

We extend known results regarding the maximum rectilinear crossing number of the cycle graph (Cn) and the complete graph (Kn ) to the class of general d-regular graphs Rn,d. We present the generalized star drawings of the d-regular graphs Sn,d of order n where n + d ≡ 1 (mod 2) and prove that they maximize the maximum rectilinear crossing numbers. A star-like drawing of Sn,d for n ≡ d ≡ 0 (mod 2) is introduced and we conjecture that this drawing maximizes the maximum rectilinear crossing numbers, too. We offer a simpler proof of two results initially proved by …

The Orchard Crossing Number Of An Abstract Graph, Elie Feder, David Garber

Publications and Research

.We introduce the Orchard crossing number, which is defined in a similar way to the well-known rectilinear crossing number. We compute the Orchard crossing number for some simple families of graphs. We also prove some properties of this crossing number.

Moreover, we define a variant of this crossing number which is tightly connected to the rectilinear crossing number, and compute it for some simple families of graphs.

Methods Of Assessing And Ranking Probable Sources Of Error, Nataniel Greene

Publications and Research

A classical method for ranking n potential events as sources of error is Bayes' theorem. However, a ranking based on Bayes' theorem lacks a fundamental symmetry: the ranking in terms of blame for error will not be the reverse of the ranking in terms of credit for lack of error. While this is not a flaw in Bayes' theorem, it does lead one to inquire whether there are related methods which have such symmetry. Related methods explored here include the logical version of Bayes' theorem based on probabilities of conditionals, probabilities of biconditionals, and ratios or differences of credit to …

A Wavelet-Based Method For Overcoming The Gibbs Phenomenon, Nataniel Greene

Publications and Research

The Gibbs phenomenon refers to the lack of uniform convergence which occurs in many orthogonal basis approximations to piecewise smooth functions. This lack of uniform convergence manifests itself in spurious oscillations near the points of discontinuity and a low order of convergence away from the discontinuities. Here we describe a numerical procedure for overcoming the Gibbs phenomenon called the inverse wavelet reconstruction method. The method takes the Fourier coefficients of an oscillatory partial sum and uses them to construct the wavelet coefficients of a non-oscillatory wavelet series.

An Overview Of Conditionals And Biconditionals In Probability, Nataniel Greene

Publications and Research

Conditional and biconditional statements are a standard part of symbolic logic but they have only recently begun to be explored in probability for applications in artificial intelligence. Here we give a brief overview of the major theorems involved and illustrate them using two standard model problems from conditional probability.

Fourier Series Of Orthogonal Polynomials, Nataniel Greene

Publications and Research

Explicit formulas for the Fourier coefficients of the Legendre polynomials can be found in the Bateman Manuscript Project. However, similar formulas for more general classes of orthogonal polynomials do not appear to have been worked out. Here we derive explicit formulas for the Fourier series of Gegenbauer, Jacobi, Laguerre and Hermite polynomials.

Formulas For The Fourier Series Of Orthogonal Polynomials In Terms Of Special Functions, Nataniel Greene

Publications and Research

An explicit formula for the Fourier coefficient of the Legendre polynomials can be found in the Bateman Manuscript Project. However, formulas for more general classes of orthogonal polynomials do not appear to have been worked out. Here we derive explicit formulas for the Fourier series of Gegenbauer, Jacobi, Laguerre and Hermite polynomials. The methods described here apply in principle to a class of polynomials, including non-orthogonal polynomials.

Inverse Wavelet Reconstruction For Resolving The Gibbs Phenomenon, Nataniel Greene

Publications and Research

The Gibbs phenomenon refers to the lack of uniform convergence which occurs in many orthogonal basis approximations to piecewise smooth functions. This lack of uniform convergence manifests itself in spurious oscillations near the points of discontinuity and a low order of convergence away from the discontinuities. Here we describe a numerical procedure for overcoming the Gibbs phenomenon called the inverse wavelet reconstruction method. The method takes the Fourier coefficients of an oscillatory partial sum and uses them to construct the wavelet coefficients of a non-oscillatory wavelet series.

Iterated Aluthge Transforms: A Brief Survey, Jorge Antezana, Enrique R. Pujals, Demetrio Stojanoff

Publications and Research

Given an r × r complex matrix T, if T = U|T| is the polar decomposition of T, then the Aluthge transform is defined by

∆(T) = |T|^1/2U|T|^1/2.

Let ∆ⁿ(T) denote the n-times iterated Aluthge transform of T, i.e. ∆⁰(T) = T and ∆ⁿ(T) = ∆(∆ⁿ⁻¹(T)), n ∈ N. In this paper we make a brief survey on the known properties and applications of …

Strokes Of Existence: The Connection Of All Things, Mari Gorman

Graduate Student Publications and Research

Acted or real—and all life is real whether one is acting or not—the common denominator and consistent, ubiquitous reality of life and all behavior is that it manifests in the form of relationships on all scales. But what is a relationship? Until now, the answer to this question has not been sufficiently known. As a result of many years of empirical research that began with the aim of discovering what is going on in a gifted actor when s/he is playing a character that can be observed and experienced as a living, intuitive being, and based on the knowledge that …

Towards The Computation Of The Convex Hull Of A Configuration From Its Corresponding Separating Matrix, Elie Feder, David Garber

Publications and Research

In this paper we cope with the following problem compute the size of the convex hull of a configuration C where the given data is the number of separating lines between any two points of the configuration (where the lines are generated by pairs of other points of the configuration)

We give an algorithm for the case that the convex hull is of size 3 and a partial algorithm and some directions for the case that the convex hull is of size bigger than 3.

On Groups Of Homological Dimension One, Jonathan Cornick

Publications and Research

It has been conjectured that the groups of homological dimension one are precisely the nontrivial locally free groups. Some algebraic, geometric and analytic properties of any potential counter example to the conjecture are discussed.

Vortices And Chaos In The Quantum Fluid, D. A. Wisniacki, E. R. Pujals, F. Borondo

Publications and Research

The motion of a single vortex originates chaos in the quantum fluid defined in Bohm's interpretation of quantum mechanics. Here we analize this situation in a very simple case: one single vortex in a rectangular billiard.

A Remark On Conservative Diffeomorphisms, Jairo Bochi, Bassam R. Fayad, Enrique Pujals

Publications and Research

Abstract:

We show that a stably ergodic diffeomorphism can be C¹ approximated by a diffeomorphism having stably non-zero Lyapunov exponents.

Résumé:

On montre qu'un difféomorphisme stablement ergodique peut être C¹ approché par un difféomorphisme ayant des exposants de Lyapunov stablement non-nuls.

Intersecting Circles And Their Inner Tangent Circle, Max Tran

Publications and Research

We derive the general equation for the radius of the inner tangent circle that is associated with three pairwise intersecting circles. We then look at three special cases of the equation.

Robustly Transitive Sets And Heterodimensional Cycles, Christian Bonatti, Lorenzo J. Díaz, Enrique R. Pujals, Jorge Rocha

Publications and Research

It is known that all non-hyperbolic robustly transitive sets Λ_φ have a dominated splitting and, generically, contain periodic points of different indices. We show that, for a C¹-dense open subset of diffeomorphisms φ, the indices of periodic points in a robust transitive set Λ_φ form an interval in ℕ. We also prove that the homoclinic classes of two periodic points in Λ_φ are robustly equal. Finally, we describe what sort of homoclinic tangencies may appear in Λ_φ by studying its dominated splittings.

On C^1 Robust Singular Transitive Sets For Three-Dimensional Flows, Carlos Arnoldo Morales, Maria José Pacífico, Enrique Ramiro Pujals

Publications and Research

Abstract:

The main goal of this paper is to study robust invariant transitive sets containing singularities for C¹ flows on three-dimensional compact boundaryless manifolds:they are partially hyperbolic with volume expanding central direction. Moreover, they are either attractors or repellers. Robust here means that this property cannot be destroyed by small C¹-perturbations of the flow.

Résumé:

Le but de ce travail est d'étudier des ensembles invariants robustes ayant des singularités pour des flots C¹ sur des variétés tridimensionelles : ce sont des ensembles hyperboliques singuliers. << Robuste >> veut dire ici que cette propriété ne peut être détruite par des …

Global Attractors From The Explosion Of Singular Cycles, Carlos Arnoldo Morales, Maria José Pacífico, Enrique Ramiro Pujals

Publications and Research

Abstract:

In this paper we announce recent results on the existence and bifurcations of hyperbolic systems leading to non-hyperbolic global attractors.

Résumé:

Nous présentons dans cette Note des résultats récents concernant l’existence et les bifurcations d’un nouvel attracteur global chaotique.

Difference Equations, Isoperimetric Inequality And Transience Of Certain Random Walks, Jozef Dodziuk

Publications and Research

No abstract provided.

Finite-Difference Approach To The Hodge Theory Of Harmonic Forms, Jozef Dodziuk

Publications and Research

No abstract provided.

D-Structures And Their Semantics, Rohit J. Parikh

Publications and Research

"Many logicians are familiar with the game theoretic approach to semantics, due to Jaakko Hintikka. This paper by me contains class notes of a logic course at Boston University in fall 1972. It has similar game theoretic ideas, developed quite independently, but influenced by the work of A. Ehrenfeucht. It applies to a larger class of logics, including classical logic, intuitionistic logic and the *-semantics of Ehrenfeucht. The treatment is via D-structures which are finite approximations of infinite structures. For various reasons I did not publish this paper then, but some abstracts, both by myself as well as joint abstracts …