Results 11 to 20 of about 59,986 (267)
A Definition of Type Domain of a Parallelotope
Моделирование и анализ информационных систем, 2013 Each convex polytope P = P(α) can be described by a set of linear inequalities determined by vectors p and right hand sides α(p). For a fixed set of vectors p, a type domain D(P₀) of a polytope P₀ and, in particular, of a parallelotope P₀ is defined as a
V. P. Grishukhin
doaj +3 more sources
Journal of Inequalities and Applications, 2019 The main purpose and motivation of this work is to investigate and provide some new identities, inequalities and relations for combinatorial numbers and polynomials, and for Peters type polynomials with the help of their generating functions. The results
Yilmaz Simsek, Ji Suk So
doaj +1 more source
Journal of Inequalities and Applications, 2020 The goal of this paper is to demonstrate many explicit computational formulas and relations involving the Changhee polynomials and numbers and their differential equations with the help of functional equations and partial derivative equations for ...
Ji Suk So, Yilmaz Simsek
doaj +1 more source
Estimating Multidimensional Persistent Homology through a Finite Sampling [PDF]
, 2015 An exact computation of the persistent Betti numbers of a submanifold $X$ of a Euclidean space is possible only in a theoretical setting. In practical situations, only a finite sample of $X$ is available.
Cavazza, Niccolò +2 more
core +2 more sources
A generalized formula of Hardy
International Journal of Mathematics and Mathematical Sciences, 1994 We give new formulae applicable to the theory of partitions. Recent work suggests they also relate to quasi-crystal structure and self-similarity. Other recent work has given continued fractions for the type of functions herein.
Geoffrey B. Campbell
doaj +1 more source
Depth lower bounds in Stabbing Planes for combinatorial principles [PDF]
Logical Methods in Computer ScienceStabbing Planes (also known as Branch and Cut) is a proof system introduced very recently which, informally speaking, extends the DPLL method by branching on integer linear inequalities instead of single variables.
Stefan Dantchev +3 more
doaj +1 more source
On the Relationship between Convex Bodies Related to Correlation Experiments with Dichotomic Observables [PDF]
, 2006 In this paper we explore further the connections between convex bodies related to quantum correlation experiments with dichotomic variables and related bodies studied in combinatorial optimization, especially cut polyhedra.
+23 more
core +3 more sources
Journal of the Mechanical Behavior of Materials, 2015 This paper introduces constructing convex-relaxed programs for nonconvex optimization problems. Branch-and-bound algorithms are convex-relaxation-based techniques.
Keller André A.
doaj +1 more source
Limitations of Variational Quantum Algorithms: A Quantum Optimal Transport Approach
PRX Quantum, 2023 The impressive progress in quantum hardware of the last years has raised the interest of the quantum computing community in harvesting the computational power of such devices.
Giacomo De Palma +3 more
doaj +1 more source
Two bounds on the noncommuting graph
Open Mathematics, 2015 Erdős introduced the noncommuting graph in order to study the number of commuting elements in a finite group. Despite the use of combinatorial ideas, his methods involved several techniques of classical analysis.
Nardulli Stefano, Russo Francesco G.
doaj +1 more source