Related papers: There is but one PDS in $\mathbb{Z}^{3}$ inducing …

We demonstrate a new method of extracting parton distributions from lattice calculations. The starting idea is to treat the generic equal-time matrix element ${\cal M} (Pz_3, z_3^2)$ as a function of the Ioffe time $\nu = Pz_3$ and the…

Utilizing the Weierstrass representation for embedded doubly periodic minimal surfaces with parallel ends, we construct entire singly periodic graphs of spacelike maximal surfaces with isolated cone-like singularities in the…

For $p$ an odd prime and $F$ the cyclic group of order $p$, we show that the number of conjugacy classes of embeddings of $F$ in $SU(p)$ such that no element of $F$ has 1 as an eigenvalue is $(1+C_{p-1})/p$, where $C_{p-1}$ is a Catalan…

Let $G$ be a simple connected graph with $n\geq 5$ vertices. In this note, we will prove that $s_3(G)\leq n$, and characterize the graphs which satisfy that $s_3(G)=n, n-1, n-2, $ or $n-3$, where $s_3(G)$ is the third invariant factor of…

We show that the spectrum of the Schrodinger operator on a finite, metric graph determines uniquely the connectivity matrix and the bond lengths, provided that the lengths are non-commensurate and the connectivity is simple (no parallel…

Using an anisotropic hybridization matrix element, V($\vec k$), reflecting cubic symmetry at the ``rare-earth'' sites of the infinite U Anderson lattice, we calculate the bare quasiparticle scattering amplitude to order 1/N using slave…

Using the combinatorics of two interpenetrating face centered cubic lattices together with the part of calculus naturally encoded in combinatorial topology, we construct from first principles a lattice model of 3D incompressible…

We prove that a well-distributed subset of R^2 can have a separated distance set only if the distance is induced by a polygon.

We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including explicit formulas for…

A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…

For each prime number $p$, the dynamical behavior of the square mapping on the ring $\mathbb{Z}_p$ of $p$-adic integers is studied. For $p=2$, there are only attracting fixed points with their attracting basins. For $p\geq 3$, there are a…

J. Davis showed that the topological concordance class of a link in the 3-sphere is uniquely determined by its Alexander polynomial for 2-component links with Alexander polynomial one. A similar result for knots with Alexander polynomial…

In this paper we determine, under some mild restrictions, the lattice of submodules $\gL$ of a module $M$ all of whose composition factors have multiplicity one. Such a lattice is distributive, and hence determined by its poset of down-sets…

In this paper we generalize [3] and prove that the class of accessible and saddle-conservative cocycles (a wide class which includes cocycles evolving in GL(d,R), SL(d,R) and Sp(d,R) Lp-densely have a simple spectrum. We also generalize [3,…

We provide an equivalent condition for the monogenity of the ring of integers of any cyclic cubic field. We show that if a cyclic cubic field is monogenic then it is a simplest cubic field $K_t$ which is the splitting field of a Shanks…

This paper is the last paper in a series of five papers. Building on earlier papers in this series, we prove an analogue of Kuratowski's characterisation of graph planarity for three dimensions. More precisely, a simply connected…

Discrete models have a long tradition in engineering, including finite state machines, Boolean networks, Petri nets, and agent-based models. Of particular importance is the question of how the model structure constrains its dynamics. This…

Graph dynamical systems (GDSs) can be used to describe a wide range of distributed, nonlinear phenomena. In this paper we characterize cycle equivalence of a class of finite GDSs called sequential dynamical systems SDSs. In general, two…

Let $G$ be a graph. A set $S$ of vertices in $G$ dominates the graph if every vertex of $G$ is either in $S$ or a neighbor of a vertex in $S$. Finding a minimal cardinality set which dominates the graph is an NP-complete problem. The graph…

The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph $G$ of any system of segments in the plane is {\em…