English
Related papers

Related papers: Sublinear circuits for polyhedral sets

200 papers

We first review some invariant theoretic results about the finite subgroups of SU(2) in a quick algebraic way by using the McKay correspondence and quantum affine Cartan matrices. By the way it turns out that some parameters (a,b,h;p,q,r)…

Representation Theory · Mathematics 2007-05-23 Ruedi Suter

In this paper, we demonstrate the existence of positive solutions for certain weakly coupled elliptic systems of sublinear growth under homogeneous Dirichlet boundary conditions. Our findings generalize existing results related to sublinear…

Analysis of PDEs · Mathematics 2025-08-01 Jean C. Cortissoz

A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…

Algebraic Geometry · Mathematics 2016-06-30 Mario Kummer

We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…

Dynamical Systems · Mathematics 2007-05-23 Marianne Akian , Stephane Gaubert , Bas Lemmens , Roger Nussbaum

Verification is one of the central tasks during circuit design. While most of the approaches have exponential worst-case behaviour, in the following techniques are discussed for proving polynomial circuit verification based on Binary…

Hardware Architecture · Computer Science 2021-04-08 Rolf Drechsler

For planar polynomials systems the existence of an invariant algebraic curve limits the number of limit cycles not contained in this curve. We present a general approach to prove non existence of periodic orbits not contained in this given…

Classical Analysis and ODEs · Mathematics 2022-10-31 Armengol Gasull , Hector Giacomini

Starting from the Maxwell's equations and without resort to the paraxial approximation, we derive equations describing stationary (1+1)-dimensional beams propagating at an arbitrary direction in an optical crystal with cubic symmetry and…

Pattern Formation and Solitons · Physics 2009-11-07 Boris V. Gisin , Boris A. Malomed

Computing control invariant sets is paramount in many applications. The families of sets commonly used for computations are ellipsoids and polyhedra. However, searching for a control invariant set over the family of ellipsoids is…

Optimization and Control · Mathematics 2020-07-07 Benoît Legat , Saša V. Raković , Raphaël M. Jungers

Multiplicative matrix semigroups with constant spectral radius (c.s.r.) are studied and applied to several problems of algebra, combinatorics, functional equations, and dynamical systems. We show that all such semigroups are characterized…

Metric Geometry · Mathematics 2014-07-25 Vladimir Protasov , Andrey Voynov

We initiate the study of a class of polytopes, which we coin polypositroids, defined to be those polytopes that are simultaneously generalized permutohedra (or polymatroids) and alcoved polytopes. Whereas positroids are the matroids arising…

Combinatorics · Mathematics 2020-10-15 Thomas Lam , Alexander Postnikov

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

Algebraic Geometry · Mathematics 2014-09-12 Eric Katz

We report analytical solutions for spatial solitons supported by layers of a quadratically nonlinear material embedded into a linear planar waveguide. A full set of symmetric, asymmetric, and antisymmetric modes pinned to a symmetric pair…

Optics · Physics 2016-04-27 Asia Shapira , Noa Voloch-Bloch , Boris A. Malomed , Ady Arie

In this paper we introduce the circuit diameter of polyhedra, which is always bounded from above by the combinatorial diameter. We consider dual transportation polyhedra defined on general bipartite graphs. For complete $M{\times}N$…

Combinatorics · Mathematics 2014-08-13 Steffen Borgwardt , Elisabeth Finhold , Raymond Hemmecke

This paper presents a fast and effective computer algebraic method for analyzing and verifying non-linear integer arithmetic circuits using a novel algebraic spectral model. It introduces a concept of algebraic spectrum, a numerical form of…

Symbolic Computation · Computer Science 2019-01-11 Cunxi Yu , Tiankai Su , Atif Yasin , Maciej Ciesielski

DR-submodular functions encompass a broad class of functions which are generally non-convex and non-concave. We study the problem of minimizing any DR-submodular function, with continuous and general integer variables, under box constraints…

Optimization and Control · Mathematics 2023-09-07 Qimeng Yu , Simge Küçükyavuz

Kliuchnikov, Maslov, and Mosca proved in 2012 that a $2\times 2$ unitary matrix $V$ can be exactly represented by a single-qubit Clifford+$T$ circuit if and only if the entries of $V$ belong to the ring $\mathbb{Z}[1/\sqrt{2},i]$. Later…

Quantum Physics · Physics 2020-04-08 Matthew Amy , Andrew N. Glaudell , Neil J. Ross

This paper studies signed graphs with possible outer-edges. We introduce and investigate the chain group, the boundary operator, the co-boundary operator, the flow group, the tension group, the homology group, the cohomology group, with…

Combinatorics · Mathematics 2025-10-13 Beifang Chen

This paper compares skew-linear and multilinear matroid representations. These are matroids that are representable over division rings and (roughly speaking) invertible matrices, respectively. The main tool is the von Staudt construction,…

Combinatorics · Mathematics 2025-05-21 Lukas Kühne , Rudi Pendavingh , Geva Yashfe

Establishing explicit formulas of coderivatives with respect to a set of the normal cone mapping to a polyhedron, the solution set of a variational inequalities system, is one of the main goals of this paper. By using our coderivative…

Optimization and Control · Mathematics 2023-12-27 Vo Duc Thinh , Xiaolong Qin , Jen-Chih Yao

We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…

Computational Complexity · Computer Science 2012-10-24 Bruno Grenet , Erich Kaltofen , Pascal Koiran , Natacha Portier
‹ Prev 1 4 5 6 7 8 10 Next ›