Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Combinatorial analysis (3)
- Associative algebras (2)
- Eigenvalues (2)
- Matrices (2)
- Numerical analysis (2)
-
- Abelian functions (1)
- Attractors (Mathematics) (1)
- Boolean algebra (1)
- Boolean dynamics (1)
- Boundary Conditions (Differential Equations) (1)
- Boundary value problems (1)
- Combinatorial topology -- Data processing (1)
- Convex sets (1)
- Differential geometry (1)
- Directed graphs (1)
- Directional derivatives (1)
- Discrete mathematics (1)
- Discretization (Mathematics) (1)
- Dynamics -- Mathematical models (1)
- Dynamics -- Statistics -- Testing (1)
- Eigenvalues -- Data processing (1)
- Estimation (Mathematics) (1)
- Exponential functions (1)
- Finite element method (1)
- Finite elements (1)
- Galerkin methods (1)
- Ideals (Algebra) (1)
- Irreducible polynomials (1)
- Laplacian matrices -- Eigenvalues (1)
- Markov processes (1)
Articles 1 - 13 of 13
Full-Text Articles in Discrete Mathematics and Combinatorics
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 …
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.
Classification Of Minimal Separating Sets In Low Genus Surfaces, J. J. P. Veerman, William Maxwell, Victor Rielly, Austin K. Williams
Classification Of Minimal Separating Sets In Low Genus Surfaces, J. J. P. Veerman, William Maxwell, Victor Rielly, Austin K. Williams
Mathematics and Statistics Faculty Publications and Presentations
Consider a surface S and let M ⊂ S. If S \ M is not connected, then we say M separates S, and we refer to M as a separating set of S. If M separates S, and no proper subset of M separates S, then we say M is a minimal separating set of S. In this paper we use computational methods of combinatorial topology to classify the minimal separating sets of the orientable surfaces of genus g = 2 and g = 3. The classification for genus 0 and 1 was done …
A Weighted Möbius Function, Derek Garton
A Weighted Möbius Function, Derek Garton
Mathematics and Statistics Faculty Publications and Presentations
Fix an odd prime ℓ and let G be the poset of isomorphism classes of finite abelian ℓ-groups, ordered by inclusion. If ξ:G→R≥0 is a discrete probability distribution on G and A ∈ G, define the Ath moment of ξ to be . The question of determining conditions that ensure ξ is completely determined by its moments has been of recent interest in many problems of Cohen–Lenstra type. Furthermore, recovering ξ from its moments requires a new Möbius-type inversion formula on G. In this paper, we define this function, relate it to the classical Möbius …
Cycle Structures Of Orthomorphisms Extending Partial Orthomorphisms Of Boolean Groups, Nichole Louise Schimanski, John S. Caughman Iv
Cycle Structures Of Orthomorphisms Extending Partial Orthomorphisms Of Boolean Groups, Nichole Louise Schimanski, John S. Caughman Iv
Mathematics and Statistics Faculty Publications and Presentations
A partial orthomorphism of a group GG (with additive notation) is an injection π:S→G for some S⊆G such that π(x)−x ≠ π(y) for all distinct x,y∈S. We refer to |S| as the size of π, and if S=G, then π is an orthomorphism. Despite receiving a fair amount of attention in the research literature, many basic questions remain concerning the number of orthomorphisms of a given group, and what cycle types these permutations have.
It is known that conjugation by automorphisms of G forms a group action on the set of orthomorphisms of G. In this paper, we consider the …
Tridiagonal Matrices And Boundary Conditions, J. J. P. Veerman, David K. Hammond
Tridiagonal Matrices And Boundary Conditions, J. J. P. Veerman, David K. Hammond
Mathematics and Statistics Faculty Publications and Presentations
We describe the spectra of certain tridiagonal matrices arising from differential equations commonly used for modeling flocking behavior. In particular we consider systems resulting from allowing an arbitrary boundary condition for the end of a one-dimensional flock. We apply our results to demonstrate how asymptotic stability for consensus and flocking systems depends on the imposed boundary condition.
On A Convex Set With Nondifferentiable Metric Projection, Shyan S. Akmal, Nguyen Mau Nam, J. J. P. Veerman
On A Convex Set With Nondifferentiable Metric Projection, Shyan S. Akmal, Nguyen Mau Nam, J. J. P. Veerman
Mathematics and Statistics Faculty Publications and Presentations
A remarkable example of a nonempty closed convex set in the Euclidean plane for which the directional derivative of the metric projection mapping fails to exist was constructed by A. Shapiro. In this paper, we revisit and modify that construction to obtain a convex set with smooth boundary which possesses the same property.
A Posteriori Eigenvalue Error Estimation For The Schrödinger Operator With The Inverse Square Potential, Hengguang Li, Jeffrey S. Ovall
A Posteriori Eigenvalue Error Estimation For The Schrödinger Operator With The Inverse Square Potential, Hengguang Li, Jeffrey S. Ovall
Mathematics and Statistics Faculty Publications and Presentations
We develop an a posteriori error estimate of hierarchical type for Dirichlet eigenvalue problems of the form (−∆ + (c/r) 2 )ψ = λψ on bounded domains Ω, where r is the distance to the origin, which is assumed to be in Ω. This error estimate is proven to be asymptotically identical to the eigenvalue approximation error on a family of geometrically-graded meshes. Numerical experiments demonstrate this asymptotic exactness in practice.
Exact Tests For Singular Network Data, Ian H. Dinwoodie, Kruti Pandya
Exact Tests For Singular Network Data, Ian H. Dinwoodie, Kruti Pandya
Mathematics and Statistics Faculty Publications and Presentations
We propose methodology for exact statistical tests of hypotheses for models of network dynamics. The methodology formulates Markovian exponential families, then uses sequential importance sampling to compute expectations within basins of attraction and within level sets of a sufficient statistic for an over-dispersion model. Comparisons of hypotheses can be done conditional on basins of attraction. Examples are presented.
Regularity Of Mediatrices In Surfaces, Pilar Herreros, Mario Ponce, J. J. P. Veerman
Regularity Of Mediatrices In Surfaces, Pilar Herreros, Mario Ponce, J. J. P. Veerman
Mathematics and Statistics Faculty Publications and Presentations
For distinct points p and q in a two-dimensional Riemannian manifold, one defines their mediatrix Lpq as the set of equidistant points to p and q. It is known that mediatrices have a cell decomposition consisting of a finite number of branch points connected by Lipschitz curves. This paper establishes additional geometric regularity properties of mediatrices. We show that mediatrices have the radial linearizability property, which implies that at each point they have a geometrically defined derivative in the branching directions. Also, we study the particular case of mediatrices on spheres, by showing that they are Lipschitz simple closed curves …
Kernels Of Directed Graph Laplacians, John S. Caughman Iv, J. J. P. Veerman
Kernels Of Directed Graph Laplacians, John S. Caughman Iv, J. J. P. Veerman
Mathematics and Statistics Faculty Publications and Presentations
Let G denote a directed graph with adjacency matrix Q and in- degree matrix D. We consider the Kirchhoff matrix L = D − Q, sometimes referred to as the directed Laplacian. A classical result of Kirchhoff asserts that when G is undirected, the multiplicity of the eigenvalue 0 equals the number of connected components of G. This fact has a meaningful generalization to directed graphs, as was observed by Chebotarev and Agaev in 2005. Since this result has many important applications in the sciences, we offer an independent and self-contained proof of their theorem, showing in this paper …
The Terwilliger Algebra Of An Almost-Bipartite P- And Q-Polynomial Association Scheme, John S. Caughman Iv, Mark S. Maclean, Paul M. Terwilliger
The Terwilliger Algebra Of An Almost-Bipartite P- And Q-Polynomial Association Scheme, John S. Caughman Iv, Mark S. Maclean, Paul M. Terwilliger
Mathematics and Statistics Faculty Publications and Presentations
Let Y denote a D-class symmetric association scheme with D≥3, and suppose Y is almost-bipartite P- and Q-polynomial. Let x denote a vertex of Y and let T=T(x) denote the corresponding Terwilliger algebra. We prove that any irreducible T-module W is both thin and dual thin in the sense of Terwilliger. We produce two bases for W and describe the action of T on these bases. We prove that the isomorphism class of W as a T-module is determined by two parameters, the dual endpoint and diameter of W. We find a recurrence which gives the multiplicities with which the …
The Multiplicities Of A Dual-Thin Q-Polynomial Association Scheme, Bruce E. Sagen, John S. Caughman Iv
The Multiplicities Of A Dual-Thin Q-Polynomial Association Scheme, Bruce E. Sagen, John S. Caughman Iv
Mathematics and Statistics Faculty Publications and Presentations
Let Y=(X,{Ri}1≤i≤D) denote a symmetric association scheme, and assume that Y is Q-polynomial with respect to an ordering E0,...,ED of the primitive idempotents. Bannai and Ito conjectured that the associated sequence of multiplicities mi (0≤i≤D) of Yis unimodal. Talking to Terwilliger, Stanton made the related conjecture that mi≤mi+1 and mi≤mD−i for i<D/2. We prove that if Y is dual-thin in the sense of Terwilliger, then the …