scholarly journals LS-category of moment-angle manifolds and higher order Massey products

2021 ◽  
Vol 33 (5) ◽  
pp. 1179-1205
Author(s):  
Piotr Beben ◽  
Jelena Grbić
Keyword(s):  
Simplicial Complex ◽  
Structural Properties ◽  
Lower Bounds ◽  
Higher Order ◽  
Hyperbolic Manifolds ◽  
Upper And Lower Bounds ◽  
Connected Sum ◽  
Massey Products ◽  
Higher Dimensional ◽  
Lusternik Schnirelmann

Abstract Using the combinatorics of the underlying simplicial complex K, we give various upper and lower bounds for the Lusternik–Schnirelmann (LS) category of moment-angle complexes 𝒵 K {\mathcal{Z}_{K}} . We describe families of simplicial complexes and combinatorial operations which allow for a systematic description of the LS-category. In particular, we characterize the LS-category of moment-angle complexes 𝒵 K {\mathcal{Z}_{K}} over triangulated d-manifolds K for d ≤ 2 {d\leq 2} , as well as higher-dimensional spheres built up via connected sum, join, and vertex doubling operations. We show that the LS-category closely relates to vanishing of Massey products in H * ⁢ ( 𝒵 K ) {H^{*}(\mathcal{Z}_{K})} , and through this connection we describe first structural properties of Massey products in moment-angle manifolds. Some of the further applications include calculations of the LS-category and the description of conditions for vanishing of Massey products for moment-angle manifolds over fullerenes, Pogorelov polytopes and k-neighborly complexes, which double as important examples of hyperbolic manifolds.

scholarly journals COMPLEXITY OF LINKS IN 3-MANIFOLDS

2009 ◽  
Vol 18 (10) ◽  
pp. 1439-1458 ◽  
Author(s):  
EKATERINA PERVOVA ◽  
CARLO PETRONIO
Keyword(s):  
Lower Bounds ◽  
Crossing Number ◽  
Upper And Lower Bounds ◽  
Recent Theory ◽  
Asymptotic Estimates ◽  
Connected Sum ◽  
Hyperbolic Volume ◽  
Do So

We introduce a complexity c(X) ∈ ℕ for pairs X = (M,L), where M is a closed orientable 3-manifold and L ⊂ M is a link. The definition employs simple spines, but for well-behaved X 's , we show that c(X) equals the minimal number of tetrahedra in a triangulation of M containing L in its 1-skeleton. Slightly adapting Matveev's recent theory of roots for graphs, we carefully analyze the behaviour of c under connected sum away from and along the link. We show in particular that c is almost always additive, describing in detail the circumstances under which it is not. To do so we introduce a certain (0, 2)-root for a pair X, we show that it is well-defined, and we prove that X has the same complexity as its (0, 2)-root. We then consider, for links in the 3-sphere, the relations of c with the crossing number and with the hyperbolic volume of the exterior, establishing various upper and lower bounds. We also specialize our analysis to certain infinite families of links, providing rather accurate asymptotic estimates.

scholarly journals Grid Minors in Damaged Grids

10.37236/3872 ◽  
2014 ◽  
Vol 21 (3) ◽  
Author(s):  
David Eppstein
Keyword(s):  
Lower Bounds ◽  
Upper And Lower Bounds ◽  
Grid Graph ◽  
Square Grid ◽  
Higher Dimensional

We prove upper and lower bounds on the size of the largest square grid graph that is a subgraph, minor, or shallow minor of a graph in the form of a larger square grid from which a specified number of vertices have been deleted. Our bounds are tight to within constant factors. We also provide less-tight bounds on analogous problems for higher-dimensional grids.

scholarly journals ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS

2009 ◽  
Vol 19 (06) ◽  
pp. 595-615 ◽  
Author(s):  
MANUEL ABELLANAS ◽  
PROSENJIT BOSE ◽  
JESÚS GARCÍA ◽  
FERRAN HURTADO ◽  
CARLOS M. NICOLÁS ◽  
...  
Keyword(s):  
Cellular Networks ◽  
Lower Bounds ◽  
Higher Order ◽  
Combinatorial Structure ◽  
Upper And Lower Bounds ◽  
Coloring Problem ◽  
Graph Theoretic ◽  
Convex Position ◽  
Gabriel Graph ◽  
Vertex Set

Given a set P of n points in the plane, the order-k Delaunay graph is a graph with vertex set P and an edge exists between two points p, q ∈ P when there is a circle through p and q with at most k other points of P in its interior. We provide upper and lower bounds on the number of edges in an order-k Delaunay graph. We study the combinatorial structure of the set of triangulations that can be constructed with edges of this graph. Furthermore, we show that the order-k Delaunay graph is connected under the flip operation when k ≤ 1 but not necessarily connected for other values of k. If P is in convex position then the order-k Delaunay graph is connected for all k ≥ 0. We show that the order-k Gabriel graph, a subgraph of the order-k Delaunay graph, is Hamiltonian for k ≥ 15. Finally, the order-k Delaunay graph can be used to efficiently solve a coloring problem with applications to frequency assignments in cellular networks.

scholarly journals Analysis of directional higher order jump discontinuities with trigonometric shearlets

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Kevin Schober ◽  
Jürgen Prestin
Keyword(s):  
Lower Bounds ◽  
Recent Article ◽  
Higher Order ◽  
Upper And Lower Bounds ◽  
Characteristic Functions ◽  
Directional Derivatives ◽  
Periodic Functions ◽  
Decay Properties ◽  
Jump Discontinuities ◽  
Periodic Characteristic

<p style='text-indent:20px;'>In a recent article, we showed that trigonometric shearlets are able to detect directional step discontinuities along edges of periodic characteristic functions. In this paper, we extend these results to bivariate periodic functions which have jump discontinuities in higher order directional derivatives along edges. In order to prove suitable upper and lower bounds for the shearlet coefficients, we need to generalize the results about localization- and orientation-dependent decay properties of the corresponding inner products of trigonometric shearlets and the underlying periodic functions.</p>

On the Complexity of Computing and Learning with Multiplicative Neural Networks

2002 ◽  
Vol 14 (2) ◽  
pp. 241-301 ◽  
Author(s):  
Michael Schmitt
Keyword(s):  
Neural Networks ◽  
Lower Bounds ◽  
Higher Order ◽  
Upper And Lower Bounds ◽  
Biological Behavior ◽  
Vc Dimension ◽  
Neuron Models ◽  
Learning Capabilities ◽  
Order Of Magnitude ◽  
The Impact

In a great variety of neuron models, neural inputs are combined using the summing operation. We introduce the concept of multiplicative neural networks that contain units that multiply their inputs instead of summing them and thus allow inputs to interact nonlinearly. The class of multiplicative neural networks comprises such widely known and well-studied network types as higher-order networks and product unit networks. We investigate the complexity of computing and learning for multiplicative neural networks. In particular, we derive upper and lower bounds on the Vapnik-Chervonenkis (VC) dimension and the pseudo-dimension for various types of networks with multiplicative units. As the most general case, we consider feedforward networks consisting of product and sigmoidal units, showing that their pseudo-dimension is bounded from above by a polynomial with the same order of magnitude as the currently best-known bound for purely sigmoidal networks. Moreover, we show that this bound holds even when the unit type, product or sigmoidal, may be learned. Crucial for these results are calculations of solution set components bounds for new network classes. As to lower bounds, we construct product unit networks of fixed depth with super-linear VC dimension. For sigmoidal networks of higher order, we establish polynomial bounds that, in contrast to previous results, do not involve any restriction of the network order. We further consider various classes of higher-order units, also known as sigma-pi units, that are characterized by connectivity constraints. In terms of these, we derive some asymptotically tight bounds. Multiplication plays an important role in both neural modeling of biological behavior and computing and learning with artificial neural networks. We briefly survey research in biology and in applications where multiplication is considered an essential computational element. The results we present here provide new tools for assessing the impact of multiplication on the computational power and the learning capabilities of neural networks.

scholarly journals On the Fractional Metric Dimension of Convex Polytopes

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
M. K. Aslam ◽  
Muhammad Javaid ◽  
Q. Zhu ◽  
Abdul Raheem
Keyword(s):  
Lower Bound ◽  
Structural Properties ◽  
Lower Bounds ◽  
Convex Polytopes ◽  
Upper And Lower Bounds ◽  
Metric Dimension ◽  
Mathematical Technique ◽  
Graph Theoretic ◽  
Chemical Structures

In order to identify the basic structural properties of a network such as connectedness, centrality, modularity, accessibility, clustering, vulnerability, and robustness, we need distance-based parameters. A number of tools like these help computer and chemical scientists to resolve the issues of informational and chemical structures. In this way, the related branches of aforementioned sciences are also benefited with these tools as well. In this paper, we are going to study a symmetric class of networks called convex polytopes for the upper and lower bounds of fractional metric dimension (FMD), where FMD is a latest developed mathematical technique depending on the graph-theoretic parameter of distance. Apart from that, we also have improved the lower bound of FMD from unity for all the arbitrary connected networks in its general form.

scholarly journals On the Generalized Distance Energy of Graphs

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 17 ◽  
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Connected Graph ◽  
Distance Matrix ◽  
Wiener Index ◽  
Diagonal Matrix ◽  
Upper And Lower Bounds ◽  
Star Graph ◽  
Extremal Graphs ◽  
Generalized Distance

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.

scholarly journals Hadamard k-fractional inequalities of Fejér type for GA-s-convex mappings and applications

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Hui Lei ◽  
Gou Hu ◽  
Zhi-Jie Cao ◽  
Ting-Song Du
Keyword(s):  
Lower Bounds ◽  
Hypergeometric Functions ◽  
Upper And Lower Bounds ◽  
Weighted Inequalities ◽  
Convex Mappings ◽  
Special Means

Abstract The main aim of this paper is to establish some Fejér-type inequalities involving hypergeometric functions in terms of GA-s-convexity. For this purpose, we construct a Hadamard k-fractional identity related to geometrically symmetric mappings. Moreover, we give the upper and lower bounds for the weighted inequalities via products of two different mappings. Some applications of the presented results to special means are also provided.

Sign in / Sign up

Export Citation Format

Share Document