Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Finite element method (23)
- Numerical analysis (18)
- Galerkin methods (17)
- Polynomials (11)
- Stochastic analysis (11)
-
- Mathematical statistics (10)
- Boundary value problems (9)
- Algorithms (8)
- Random variables -- Mathematical models (8)
- Approximation theory (7)
- Mathematical optimization (6)
- Convex functions (5)
- Discontinuous functions (5)
- Eigenvalues (5)
- Thermodynamics (5)
- Biomimicry (4)
- Differential equations (4)
- Elasticity (4)
- Error analysis (Mathematics) (4)
- Mathematical physics (4)
- Maxwell equations (4)
- Multigrid methods (Numerical analysis) (4)
- Optical coatings -- Design and construction (4)
- Stochastic orders (4)
- Chaotic behavior in systems (3)
- Combinatorial analysis (3)
- Commutative algebra (3)
- Elliptic functions (3)
- Helmholtz equation (3)
- Lagrange equations (3)
Articles 1 - 30 of 170
Full-Text Articles in Physical Sciences and Mathematics
The Trace Of T2 Takes No Repeated Values, Liubomir Chiriac, Andrei Jorza
The Trace Of T2 Takes No Repeated Values, Liubomir Chiriac, Andrei Jorza
Mathematics and Statistics Faculty Publications and Presentations
We prove that the trace of the Hecke operator T2" role="presentation" style="box-sizing: border-box; margin: 0px; padding: 0px; display: inline-block; line-height: normal; font-size: 16.2px; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; position: relative;">T2 acting on the vector space of cusp forms of level one takes no repeated values, except for 0, which only occurs when the space is trivial.
Evaluation Of Broadcast Steam Application With Mustard Seed Meal In Fruiting Strawberry, Dong Sub Kim, Steven Kim, Steven A. Fennimore
Evaluation Of Broadcast Steam Application With Mustard Seed Meal In Fruiting Strawberry, Dong Sub Kim, Steven Kim, Steven A. Fennimore
Mathematics and Statistics Faculty Publications and Presentations
Soil disinfestation with steam has potential to partially replace fumigants such as methyl bromide, chloropicrin, and 1,3-dichloropropene because it is effective, safer to apply, and has less negative impact on the environment. Here, we compared the efficacy of steam and steam + mustard seed meal (MSM) to chloropicrin on soil disinfection, plant growth, and fruit yield in a strawberry (Fragaria ×ananassa) fruiting field. The MSM was applied at 3368 kg·ha−1 before the steam application. Steam was injected into a 3-m-wide reverse tiller that was set to till 30 to 40 cm deep. Soil temperatures at depths of …
An Image Segmentation Technique With Statistical Strategies For Pesticide Efficacy Assessment, Steven B. Kim, Dong Sub Kim, Xiaoming Mo
An Image Segmentation Technique With Statistical Strategies For Pesticide Efficacy Assessment, Steven B. Kim, Dong Sub Kim, Xiaoming Mo
Mathematics and Statistics Faculty Publications and Presentations
Image analysis is a useful technique to evaluate the efficacy of a treatment for weed control. In this study, we address two practical challenges in the image analysis. First, it is challenging to accurately quantify the efficacy of a treatment when an entire experimental unit is not affected by the treatment. Second, RGB codes, which can be used to identify weed growth in the image analysis, may not be stable due to various surrounding factors, human errors, and unknown reasons. To address the former challenge, the technique of image segmentation is considered. To address the latter challenge, the proportion of …
Nonlinear Multigrid Based On Local Spectral Coarsening For Heterogeneous Diffusion Problems, Chak Shing Lee, Francois Hamon, Nicola Castelletto, Panayot S. Vassilevski, Joshua A. White
Nonlinear Multigrid Based On Local Spectral Coarsening For Heterogeneous Diffusion Problems, Chak Shing Lee, Francois Hamon, Nicola Castelletto, Panayot S. Vassilevski, Joshua A. White
Mathematics and Statistics Faculty Publications and Presentations
This work develops a nonlinear multigrid method for diffusion problems discretized by cell-centered finite volume methods on general unstructured grids. The multigrid hierarchy is constructed algebraically using aggregation of degrees of freedom and spectral decomposition of reference linear operators associated with the aggregates. For rapid convergence, it is important that the resulting coarse spaces have good approximation properties. In our approach, the approximation quality can be directly improved by including more spectral degrees of freedom in the coarsening process. Further, by exploiting local coarsening and a piecewise-constant approximation when evaluating the nonlinear component, the coarse level problems are assembled and …
A Posteriori Error Estimates For Elliptic Eigenvalue Problems Using Auxiliary Subspace Techniques, Stefano Giani, Luka Grubišić, Harri Hakula, Jeffrey S. Ovall
A Posteriori Error Estimates For Elliptic Eigenvalue Problems Using Auxiliary Subspace Techniques, Stefano Giani, Luka Grubišić, Harri Hakula, Jeffrey S. Ovall
Mathematics and Statistics Faculty Publications and Presentations
We propose an a posteriori error estimator for high-order p- or hp-finite element discretizations of selfadjoint linear elliptic eigenvalue problems that is appropriate for estimating the error in the approximation of an eigenvalue cluster and the corresponding invariant subspace. The estimator is based on the computation of approximate error functions in a space that complements the one in which the approximate eigenvectors were computed. These error functions are used to construct estimates of collective measures of error, such as the Hausdorff distance between the true and approximate clusters of eigenvalues, and the subspace gap between the corresponding true and approximate …
Convex Analysis Of Minimal Time And Signed Minimal Time Functions, D. V. Cuong, B. S. Mordukhovich, Mau Nam Nguyen, M. L. Wells
Convex Analysis Of Minimal Time And Signed Minimal Time Functions, D. V. Cuong, B. S. Mordukhovich, Mau Nam Nguyen, M. L. Wells
Mathematics and Statistics Faculty Publications and Presentations
In this paper we first consider the class of minimal time functions in the general setting of locally convex topological vector (LCTV) spaces. The results obtained in this framework are based on a novel notion of closedness of target sets with respect to constant dynamics. Then we introduce and investigate a new class of signed minimal time functions, which are generalizations of the signed distance functions. Subdifferential formulas for the signed minimal time and distance functions are obtained under the convexity assumptions on the given data.
Structure Aware Runge–Kutta Time Stepping For Spacetime Tents, Jay Gopalakrishnan, Joachim Schöberl, Christoph Wintersteiger
Structure Aware Runge–Kutta Time Stepping For Spacetime Tents, Jay Gopalakrishnan, Joachim Schöberl, Christoph Wintersteiger
Mathematics and Statistics Faculty Publications and Presentations
We introduce a new class of Runge–Kutta type methods suitable for time stepping to propagate hyperbolic solutions within tent-shaped spacetime regions. Unlike standard Runge–Kutta methods, the new methods yield expected convergence properties when standard high order spatial (discontinuous Galerkin) discretizations are used. After presenting a derivation of nonstandard order conditions for these methods, we show numerical examples of nonlinear hyperbolic systems to demonstrate the optimal convergence rates. We also report on the discrete stability properties of these methods applied to linear hyperbolic equations.
A Tutorial Of Bland Altman Analysis In A Bayesian Framework, Krissina M. Alari, Steven B. Kim, Jeffrey O. Wand
A Tutorial Of Bland Altman Analysis In A Bayesian Framework, Krissina M. Alari, Steven B. Kim, Jeffrey O. Wand
Mathematics and Statistics Faculty Publications and Presentations
There are two schools of thought in statistical analysis, frequentist, and Bayesian. Though the two approaches produce similar estimations and predictions in large-sample studies, their interpretations are different. Bland Altman analysis is a statistical method that is widely used for comparing two methods of measurement. It was originally proposed under a frequentist framework, and it has not been used under a Bayesian framework despite the growing popularity of Bayesian analysis. It seems that the mathematical and computational complexity narrows access to Bayesian Bland Altman analysis. In this article, we provide a tutorial of Bayesian Bland Altman analysis. One approach we …
A Mass Conserving Mixed Stress Formulation For Stokes Flow With Weakly Imposed Stress Symmetry, Jay Gopalakrishnan, Philip L. Lederer, Joachim Schoeberl
A Mass Conserving Mixed Stress Formulation For Stokes Flow With Weakly Imposed Stress Symmetry, Jay Gopalakrishnan, Philip L. Lederer, Joachim Schoeberl
Mathematics and Statistics Faculty Publications and Presentations
We introduce a new discretization of a mixed formulation of the incompressible Stokes equations that includes symmetric viscous stresses. The method is built upon a mass conserving mixed formulation that we recently studied. The improvement in this work is a new method that directly approximates the viscous fluid stress $\sigma$, enforcing its symmetry weakly. The finite element space in which the stress is approximated consists of matrix-valued functions having continuous “normal-tangential” components across element interfaces. Stability is achieved by adding certain matrix bubbles that were introduced earlier in the literature on finite elements for linear elasticity. Like the earlier work, …
Numerical Results For Adaptive (Negative Norm) Constrained First Order System Least Squares Formulations, Andreas Schafelner, Panayot S. Vassilevski
Numerical Results For Adaptive (Negative Norm) Constrained First Order System Least Squares Formulations, Andreas Schafelner, Panayot S. Vassilevski
Mathematics and Statistics Faculty Publications and Presentations
We perform a follow-up computational study of the recently proposed space–time first order system least squares ( FOSLS ) method subject to constraints referred to as CFOSLS where we now combine it with the new capability we have developed, namely, parallel adaptive mesh refinement (AMR) in 4D. The AMR is needed to alleviate the high memory demand in the combined space time domain and also allows general (4D) meshes that better follow the physics in space–time. With an extensive set of computational experiments, performed in parallel, we demonstrate the feasibility of the combined space–time AMR approach in both two space …
Comparing Hecke Coefficients Of Automorphic Representations, Liubomir Chiriac, Andrei Jorza
Comparing Hecke Coefficients Of Automorphic Representations, Liubomir Chiriac, Andrei Jorza
Mathematics and Statistics Faculty Publications and Presentations
We prove a number of unconditional statistical results of the Hecke coefficients for unitary cuspidal representations of over number fields. Using partial bounds on the size of the Hecke coefficients, instances of Langlands functoriality, and properties of Rankin-Selberg -functions, we obtain bounds on the set of places where linear combinations of Hecke coefficients are negative. Under a mild functoriality assumption we extend these methods to . As an application, we obtain a result related to a question of Serre about the occurrence of large Hecke eigenvalues of Maass forms. Furthermore, in the cases where the Ramanujan conjecture is satisfied, we …
On The Equality Case Of The Ramanujan Conjecture For Hilbert Modular Forms, Liubomir Chiriac
On The Equality Case Of The Ramanujan Conjecture For Hilbert Modular Forms, Liubomir Chiriac
Mathematics and Statistics Faculty Publications and Presentations
The generalized Ramanujan Conjecture for cuspidal unitary automorphic representations π on GL(2) asserts that |av(π)| ≤ 2. We prove that this inequality is strict if π is generated by a CM Hilbert modular form of parallel weight two and v is a finite place of degree one. Equivalently, the Satake parameters of πv are necessarily distinct. We also give examples where the equality case does occur for primes of degree two.
Diffusion And Consensus On Weakly Connected Directed Graphs, J. J. P. Veerman, Ewan Kummel
Diffusion And Consensus On Weakly Connected Directed Graphs, J. J. P. Veerman, Ewan Kummel
Mathematics and Statistics Faculty Publications and Presentations
Let G be a weakly connected directed graph with asymmetric graph Laplacian L. Consensus and diffusion are dual dynamical processes defined on G by x˙=−Lx for consensus and p˙=−pL for diffusion. We consider both these processes as well their discrete time analogues. We define a basis of row vectors {γ¯i}ki=1 of the left null-space of L and a basis of column vectors {γi}ki=1 of the right null-space of L in terms of the partition of G into strongly connected components. This allows for complete characterization of the asymptotic behavior of both diffusion and consensus --- discrete and continuous --- in …
Family Math Night: Increasing Engagement In University Mathematics Courses For Prospective Teachers, Eva Thanheiser
Family Math Night: Increasing Engagement In University Mathematics Courses For Prospective Teachers, Eva Thanheiser
Mathematics and Statistics Faculty Publications and Presentations
Prospective elementary school teachers (PSTs) often do not perceive mathematics activities as fun or engaging and perceive the mathematics tasks in their university content courses as inauthentic and irrelevant. Both these points were addressed by connecting the university classroom tasks to the K–5 environment via a Family Math Night (FMN). Survey results from 23 PSTs showed that PSTs were excited about the authenticity of the tasks, learned about children’s mathematical thinking, and reconceptualized mathematics learning as potentially enjoyable. In combination, these results may lead to PSTs’ increased engagement in the mathematics content course and, thus, result in their increased mathematics …
Navigating Around Convex Sets, J. J. P. Veerman
Navigating Around Convex Sets, J. J. P. Veerman
Mathematics and Statistics Faculty Publications and Presentations
We review some basic results of convex analysis and geometry in Rn in the context of formulating a differential equation to track the distance between an observer flying outside a convex set K and K itself.
Leveraging Variation Of Historical Number Systems To Build Understanding Of The Base-Ten Place-Value System, Eva Thanheiser, Kathleen Melhuish
Leveraging Variation Of Historical Number Systems To Build Understanding Of The Base-Ten Place-Value System, Eva Thanheiser, Kathleen Melhuish
Mathematics and Statistics Faculty Publications and Presentations
Prospective elementary school teachers (PTs) come to their mathematics courses fluent in using procedures for adding and subtracting multidigit whole numbers, but many are unaware of the essential features inherent in understanding the base-ten place-value system (i.e., grouping, place value, base). Understanding these features is crucial to understanding and teaching number and place value. The research aims of this paper are (1) to present a local instructional theory (LIT), designed to familiarize PTs with these features through comparison with historical number systems and (2) to present the effects of using the LIT in the PT classroom. A theory of learning …
Analysis Of Feast Spectral Approximations Using The Dpg Discretization, Jay Gopalakrishnan, Luka Grubišić, Jeffrey S. Ovall, Benjamin Quanah Parker
Analysis Of Feast Spectral Approximations Using The Dpg Discretization, Jay Gopalakrishnan, Luka Grubišić, Jeffrey S. Ovall, Benjamin Quanah Parker
Mathematics and Statistics Faculty Publications and Presentations
A filtered subspace iteration for computing a cluster of eigenvalues and its accompanying eigenspace, known as “FEAST”, has gained considerable attention in recent years. This work studies issues that arise when FEAST is applied to compute part of the spectrum of an unbounded partial differential operator. Specifically, when the resolvent of the partial differential operator is approximated by the discontinuous Petrov Galerkin (DPG) method, it is shown that there is no spectral pollution. The theory also provides bounds on the discretization errors in the spectral approximations. Numerical experiments for simple operators illustrate the theory and also indicate the value of …
Active Learning In Computer-Based College Algebra, Steven Boyce, Joyce O'Halloran
Active Learning In Computer-Based College Algebra, Steven Boyce, Joyce O'Halloran
Mathematics and Statistics Faculty Publications and Presentations
We describe the process of adjusting the balance between computerbased learning and peer interaction in a college algebra course. In our first experimental class, students used the adaptive-learning program ALEKS within an emporium-style format. Comparing student performance in the emporium format class with that in a traditional lecture format class, we found an improvement in procedural skills, but a weakness in the students’ conceptual understanding of mathematical ideas. Consequently, we shifted to a blended format, cutting back on the number of ALEKS (procedural) topics and integrating activities that fostered student discourse about mathematics concepts. In our third iteration using ALEKS, …
A Bayesian Nonparametric Multiple Testing Procedure For Comparing Several Treatments Against A Control, Luis Gutiérrez, Andrés Barrientos, Jorge González, Daniel Taylor-Rodríguez
A Bayesian Nonparametric Multiple Testing Procedure For Comparing Several Treatments Against A Control, Luis Gutiérrez, Andrés Barrientos, Jorge González, Daniel Taylor-Rodríguez
Mathematics and Statistics Faculty Publications and Presentations
We propose a Bayesian nonparametric strategy to test for differences between a control group and several treatment regimes. Most of the existing tests for this type of comparison are based on the differences between location parameters. In contrast, our approach identifies differences across the entire distribution, avoids strong modeling assumptions over the distributions for each treatment, and accounts for multiple testing through the prior distribution on the space of hypotheses. The proposal is compared to other commonly used hypothesis testing procedures under simulated scenarios. Two real applications are also analyzed with the proposed methodology.
Stability Conditions For Coupled Oscillators In Linear Arrays, Pablo Enrique Baldivieso Blanco, J.J.P. Veerman
Stability Conditions For Coupled Oscillators In Linear Arrays, Pablo Enrique Baldivieso Blanco, J.J.P. Veerman
Mathematics and Statistics Faculty Publications and Presentations
In this paper, we give necessary conditions for stability of flocks in R. We focus on linear arrays with decentralized agents, where each agent interacts with only a few its neighbors. We obtain explicit expressions for necessary conditions for asymptotic stability in the case that the systems consists of a periodic arrangement of two or three different types of agents, i.e. configurations as follows: ...2-1-2-1 or ...3-2-1-3-2-1. Previous literature indicated that the (necessary) condition for stability in the case of a single agent (...1-1-1) held that the first moment of certain coefficients governing the interactions between agents has to be …
A Dc Programming Approach For Solving Multicast Network Design Problems Via The Nesterov Smoothing Technique, Wondi Geremew, Mau Nam Nguyen, A. Semenov, V. Boginski, E. Pasiliao
A Dc Programming Approach For Solving Multicast Network Design Problems Via The Nesterov Smoothing Technique, Wondi Geremew, Mau Nam Nguyen, A. Semenov, V. Boginski, E. Pasiliao
Mathematics and Statistics Faculty Publications and Presentations
This paper continues our effort initiated in [19] to study Multicast Communication Networks, modeled as bilevel hierarchical clustering problems, by using mathematical optimization techniques. Given a finite number of nodes, we consider two different models of multicast networks by identifying a certain number of nodes as cluster centers, and at the same time, locating a particular node that serves as a total center so as to minimize the total transportation cost through the network. The fact that the cluster centers and the total center have to be among the given nodes makes this problem a discrete optimization problem. Our approach …
Dispersion Analysis Of Hdg Methods, Jay Gopalakrishnan, Manuel Solano, Felipe Vargas
Dispersion Analysis Of Hdg Methods, Jay Gopalakrishnan, Manuel Solano, Felipe Vargas
Mathematics and Statistics Faculty Publications and Presentations
This work presents a dispersion analysis of the Hybrid Discontinuous Galerkin (HDG) method. Considering the Helmholtz system, we quantify the discrepancies between the exact and discrete wavenumbers. In particular, we obtain an analytic expansion for the wavenumber error for the lowest order Single Face HDG (SFH) method. The expansion shows that the SFH method exhibits convergence rates of the wavenumber errors comparable to that of the mixed hybrid Raviart–Thomas method. In addition, we observe the same behavior for the higher order cases in numerical experiments.
Spatial Factor Models For High-Dimensional And Large Spatial Data: An Application In Forest Variable Mapping, Daniel Taylor-Rodríguez, Andrew O. Finley, Abhirup Datta, Chad Babcock, Hans-Erik Andersen, Bruce D. Cook, Douglas C. Morton, Sudipto Banerjee
Spatial Factor Models For High-Dimensional And Large Spatial Data: An Application In Forest Variable Mapping, Daniel Taylor-Rodríguez, Andrew O. Finley, Abhirup Datta, Chad Babcock, Hans-Erik Andersen, Bruce D. Cook, Douglas C. Morton, Sudipto Banerjee
Mathematics and Statistics Faculty Publications and Presentations
Gathering information about forest variables is an expensive and arduous activity. As such, directly collecting the data required to produce high-resolution maps over large spatial domains is infeasible. Next generation collection initiatives of remotely sensed Light Detection and Ranging (LiDAR) data are specifically aimed at producing complete-coverage maps over large spatial domains. Given that LiDAR data and forest characteristics are often strongly correlated, it is possible to make use of the former to model, predict, and map forest variables over regions of interest. This entails dealing with the high-dimensional (∼102 ) spatially dependent LiDAR outcomes over a large number …
Ideals, Big Varieties, And Dynamic Networks, Ian H. Dinwoodie
Ideals, Big Varieties, And Dynamic Networks, Ian H. Dinwoodie
Mathematics and Statistics Faculty Publications and Presentations
The advantage of using algebraic geometry over enumeration for describing sets related to attractors in large dynamic networks from biology is advocated. Examples illustrate the gains.
Connection And Curvature In Crystals With Non-Constant Dislocation Density, Marek Z. Elźanowski, Gareth P. Parry
Connection And Curvature In Crystals With Non-Constant Dislocation Density, Marek Z. Elźanowski, Gareth P. Parry
Mathematics and Statistics Faculty Publications and Presentations
Given a smooth defective solid crystalline structure defined by linearly independent ‘lattice’ vector fields, the Burgers vector construction characterizes some aspect of the ‘defectiveness’ of the crystal by virtue of its interpretation in terms of the closure failure of appropriately defined paths in the material and this construction partly determines the distribution of dislocations in the crystal. In the case that the topology of the body manifold M is trivial (e.g., a smooth crystal defined on an open set in R2), it would seem at first glance that there is no corresponding construction that leads to the notion of a …
A New Method For Multi-Bit And Qudit Transfer Based On Commensurate Waveguide Arrays, Jovan Petrovic, J. J. P. Veerman
A New Method For Multi-Bit And Qudit Transfer Based On Commensurate Waveguide Arrays, Jovan Petrovic, J. J. P. Veerman
Mathematics and Statistics Faculty Publications and Presentations
The faithful state transfer is an important requirement in the construction of classical and quantum computers. While the high-speed transfer is realized by optical-fibre interconnects, its implementation in integrated optical circuits is affected by cross-talk. The cross-talk between densely packed optical waveguides limits the transfer fidelity and distorts the signal in each channel, thus severely impeding the parallel transfer of states such as classical registers, multiple qubits and qudits. Here, we leverage on the suitably engineered cross-talk between waveguides to achieve the parallel transfer on optical chip. Waveguide coupling coefficients are designed to yield commensurate eigenvalues of the array and …
Clustering And Multifacility Location With Constraints Via Distance Function Penalty Methods And Dc Programming, Mau Nam Nguyen, Thai An Nguyen, Sam Reynolds, Tuyen Tran
Clustering And Multifacility Location With Constraints Via Distance Function Penalty Methods And Dc Programming, Mau Nam Nguyen, Thai An Nguyen, Sam Reynolds, Tuyen Tran
Mathematics and Statistics Faculty Publications and Presentations
This paper is a continuation of our effort in using mathematical optimization involving DC programming in clustering and multifacility location. We study a penalty method based on distance functions and apply it particularly to a number of problems in clustering and multifacility location in which the centers to be found must lie in some given set constraints. We also provide different numerical examples to test our method.
Intensity Inhomogeneity Correction Of Sd-Oct Data Using Macular Flatspace, Andrew Lang, Aaron Carass, Bruno M. Jedynak, Sharon D. Solomon, Peter A. Calabresi, Jerry L. Prince
Intensity Inhomogeneity Correction Of Sd-Oct Data Using Macular Flatspace, Andrew Lang, Aaron Carass, Bruno M. Jedynak, Sharon D. Solomon, Peter A. Calabresi, Jerry L. Prince
Mathematics and Statistics Faculty Publications and Presentations
Images of the retina acquired using optical coherence tomography (OCT) often suffer from intensity inhomogeneity problems that degrade both the quality of the images and the performance of automated algorithms utilized to measure structural changes. This intensity variation has many causes, including off-axis acquisition, signal attenuation, multi-frame averaging, and vignetting, making it difficult to correct the data in a fundamental way. This paper presents a method for inhomogeneity correction by acting to reduce the variability of intensities within each layer. In particular, the N3 algorithm, which is popular in neuroimage analysis, is adapted to work for OCT data. N3 works …
Bootcmatch: A Software Package For Bootstrap Amg Based On Graphweighted Matching, Pasqua D'Ambra, Salvatore Filipone, Panayot S. Vassilevski
Bootcmatch: A Software Package For Bootstrap Amg Based On Graphweighted Matching, Pasqua D'Ambra, Salvatore Filipone, Panayot S. Vassilevski
Mathematics and Statistics Faculty Publications and Presentations
This article has two main objectives: one is to describe some extensions of an adaptive Algebraic Multigrid (AMG) method of the form previously proposed by the first and third authors, and a second one is to present a new software framework, named BootCMatch, which implements all the components needed to build and apply the described adaptive AMG both as a stand-alone solver and as a preconditioner in a Krylov method. The adaptive AMG presented is meant to handle general symmetric and positive definite (SPD) sparse linear systems, without assuming any a priori information of the problem and its origin; the …
On The Girth And Diameter Of Generalized Johnson Graphs, Louis Anthony Agong, Carmen Amarra, John Caughman, Ari J. Herman, Taiyo S. Terada
On The Girth And Diameter Of Generalized Johnson Graphs, Louis Anthony Agong, Carmen Amarra, John Caughman, Ari J. Herman, Taiyo S. Terada
Mathematics and Statistics Faculty Publications and Presentations
Let v > k > i be non-negative integers. The generalized Johnson graph, J(v,k,i), is the graph whose vertices are the k-subsets of a v-set, where vertices A and B are adjacent whenever |A∩B|= i. In this article, we derive general formulas for the girth and diameter of J(v,k,i). Additionally, we provide a formula for the distance between any two vertices A and B in terms of the cardinality of their intersection.