相关论文: Finding an Integral vector in an Unknown Polyhedra…

In this paper, we establish an integral expression for the Dunkl kernel in the context of Dihedral group of an arbitrary order by using the results in \cite{M-Y-Vk} where a construction of the Dunkl intertwining operator for a large set of…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…

We initiate the systematic study of the following Tur\'an-type question. Suppose $\Gamma$ is a graph with $n$ vertices such that the edge density between any pair of subsets of vertices of size at least $t$ is at most $1 - c$, for some $t$…

Let $\delta(\Pc) = (\delta_0, \delta_1,..., \delta_d)$ be the $\delta$-vector of an integral polytope $\Pc \subset \RR^N$ of dimension $d$. Following the previous work of characterizing the $\delta$-vectors with $\sum_{i=0}^d \delta_i \leq…

In this paper, we investigate the integrability aspects of a physically important nonlinear oscillator which lacks sufficient number of Lie point symmetries but can be integrated by quadrature. We explore the hidden symmetry, construct a…

We present several new quadrature formulas in the triangle for exact integration of polynomials. The points were computed numerically with a cardinal function algorithm which imposes that the number of quadrature points $N$ be equal to the…

Given a multi-variant polynomial inequality with a parameter, how to find the best possible value of this parameter that satisfies the inequality? For instance, find the greatest number $k$ that satisfies $ a^3+b^3+c^3+…

We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…

A class of infinite dimensional Galilean conformal algebra in (2+1) dimensional spacetime is studied. Each member of the class, denoted by \alg_{\ell}, is labelled by the parameter \ell. The parameter \ell takes a spin value, i.e., 1/2, 1,…

We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph…

A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible…

The frame algorithm uses a simple recursive formula to approximate an unknown vector from its frame coefficients. This note introduces an adaptive version of the frame algorithm that maximizes the error reduction between steps in terms of…

The $\texttt{IntegerHull}$ function is part of Maple's $\texttt{PolyhedralSets}$ library, which calculates the integer hull of a given polyhedral set. This algorithm works by translating the supporting hyperplanes of the facets of the input…

Given an $n$-vertex pseudorandom graph $G$ and an $n$-vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, i.e.\ an embedding $\varphi\colon V(H)\to V(G)$ so that $\varphi(u)\varphi(v)\in E(G)$ for all…

We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let $\Gamma$ be a graph with vertex set $V$, diameter $D$, adjacency matrix $A$, and…

In this paper we study the problem of finding a maximum induced d-degenerate subgraph in a given n-vertex graph from the point of view of exact algorithms. We show that for any fixed d one can find a maximum induced d-degenerate subgraph in…

Let \( G \) be a finite non-cyclic group. Define \( \mathrm{Cyc}(G) \) as the set of all elements \( a \in G \) such that for any $b\in G$, the subgroup \( \langle a, b \rangle \) is cyclic. The \emph{non-cyclic graph} $\Gamma(G)$ of \( G…

We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…

Suppose $X$ is a simple graph. The $X-$join $\Gamma$ of a set of complete or empty graphs $\{X_x \}_{x \in V(X)}$ is a simple graph with the following vertex and edge sets: \begin{eqnarray*} V(\Gamma) &=& \{(x,y) \ | \ x \in V(X) \ \& \ y…