Related papers: A formula for the algebraic degree in semidefinite…
In this paper we settle the two-dimensional case of a conjecture involving unknown semialgebraic functions with specified smoothness. More precisely, we prove the following result: Let $\mathcal{H}$ be a semialgebraic bundle with respect to…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
We derive "numerical" criteria for the existence of embeddings of representations of finite dimensional algebras.
Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We show that the Christensen-Sinclair factorization theorem, when the underlying Hilbert spaces are finite dimensional, is an instance of strong duality of semidefinite programming. This gives an elementary proof of the result and also…
This dissertation is concerned with the study of program equivalence and algebraic effects as they arise in the theory of programming languages. Algebraic effects represent impure behaviour in a functional programming language, such as…
We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…
Based on Bergman's Lemma on centralizers, we obtain a sharp lower degree bound for nonconstant elements in a subalgebra generated by two elements of a free associative algebra over an arbitrary field.
The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…
In contrast with many other convex optimization classes, state-of-the-art semidefinite programming solvers are yet unable to efficiently solve large scale instances. This work aims to reduce this scalability gap by proposing a novel…
A bottleneck of a smooth algebraic variety $X \subset \mathbb{C}^n$ is a pair of distinct points $(x,y) \in X$ such that the Euclidean normal spaces at $x$ and $y$ contain the line spanned by $x$ and $y$. The narrowness of bottlenecks is a…
In this paper, we introduce the commutativity degree of a finite-dimensional Lie algebra over a finite field and determine upper and lower bounds for it. Moreover, we study some relations between the notion of commutativity degree and known…
The lower and upper bound of any given algorithm is one of the most crucial pieces of information needed when evaluating the computational effectiveness for said algorithm. Here a novel method of Boolean Algebraic Programming for symbolic…
Given a grading by an abelian group G on a semisimple Lie algebra L over an algebraically closed field of characteristic 0, we classify up to isomorphism the simple objects in the category of finite-dimensional G-graded L-modules. The…
We establish a Schubert calculus for Bott-Samelson resolutions in the algebraic cobordism ring of a complete flag variety G/B.
As a generalization of our previous paper [GK], we formulate a residue formula and some simple behaviors of equivariant quantum cohomology applying to compute the quantum cohomology of partial flag manifolds $F_{k_1,\cdots , k_l} $with a…
We first introduce the class of quasi-algebraically stable meromorphic maps of $\P^k.$ This class is strictly larger than that of algebraically stable meromorphic self-maps of $\P^k.$ Then we prove that all maps in the new class enjoy a…
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of semialgebraic sets given by Boolean formulas. The algorithm works in weak exponential time. This means that outside a…
We prove that the subdifferential of any semi-algebraic extended-real-valued function on $\R^n$ has $n$-dimensional graph. We discuss consequences for generic semi-algebraic optimization problems.