Related papers: Cyclic Group Projection for Enumerating Quasi-Cycl…
Given a weighted graph $G(V,E)$ with weight $\mathbf w: E\rightarrow Z^{|E|}_{+}$. A $k-$cycle covering is an edge subset $A$ of $E$ such that $G-A$ has no $k-$cycle. The minimum weight of $k-$cycle covering is the weighted covering number…
The discovery of new quantum error-correcting codes that encode several logical qubits into relatively few physical qubits motivates the development of efficient and accurate methods of decoding these systems. Here, we adopt the…
We consider the problem of under and over-approximating the image of general vector-valued functions over bounded sets, and apply the proposed solution to the estimation of reachable sets of uncertain non-linear discrete-time dynamical…
Quasicrystals are one kind of space-filling structures. The traditional crystalline approximant method utilizes periodic structures to approximate quasicrystals. The errors of this approach come from two parts: the numerical discretization,…
We further develop the theoretical framework of proof mining, a program in mathematical logic that seeks to quantify and extract computational information from prima facie `non-computational' proofs from the mainstream mathematical…
Quadratic systems with lossless quadratic terms arise in many applications, including models of atmosphere and incompressible fluid flows. Such systems have a trapping region if all trajectories eventually converge to and stay within a…
In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…
The search of high-order periodic orbits has been typically restricted to problems with symmetries that help to reduce the dimension of the search space. Well-known examples include reversible maps with symmetry lines. The present work…
In this paper we propose a heuristic technique for distributing points on the surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so called cyclic group codes.…
Constrained quasiconvex optimization problems appear in many fields, such as economics, engineering, and management science. In particular, fractional programming, which models ratio indicators such as the profit/cost ratio as fractional…
Despite its putative robustness, the realization of and control over topological quantum matter is an ongoing grand challenge. Looking forward, robust characterization protocols are needed to first certify topological substrates before they…
We analyze $f$-frequently hypercyclic, $q$-frequently hypercyclic ($q> 1$) and frequently hypercyclic $C_{0}$-semigroups ($q=1$) defined on complex sectors, working in the setting of separable infinite-dimensional Fr\'echet spaces. Some…
Capture calculus has recently been proposed as a solution to effect checking, achieved by tracking the captured references of terms in the types. Boxes, along with the box and unbox operations, are a crucial construct in capture calculus,…
Relative generalized Hamming weights (RGHWs) of a linear code respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the code. They can be used to express the information leakage of the secret…
We study the class of non-commutative Unambiguous circuits or Unique-Parse-Tree (UPT) circuits, and a related model of Few-Parse-Trees (FewPT) circuits (which were recently introduced by Lagarde, Malod and Perifel [LMP16] and Lagarde,…
The notion of a glider representation of a chain of normal subgroups of a group is defined by a new structure, i.e. a fragment for a suitable filtration on the group ring. This is a special case of general glider representations defined for…
In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to…
We study quasi-convex optimization problems, where only a subset of the constraints can be sampled, and yet one would like a probabilistic guarantee on the obtained solution with respect to the initial (unknown) optimization problem. Even…
We investigate two examples of node-based cluster summation rules that have been proposed for the quasicontinuum method: a force-based approach (Knap & Ortiz, J. Mech. Phys. Solids 49, 2001), and an energy-based approach which is a…
In this paper, we develop a nonlinear reduction framework based on our recently introduced extended group finite element method. By interpolating nonlinearities onto approximation spaces defined with the help of finite elements, the…