Related papers: Locally Associated Orders in Real Quadratic Number…
We introduce the notion of maximal orders over quaternion algebras with orthogonal involution and give a classification over local fields, and a partial classification over algebraic number fields.
We study approximation of embeddings between finite dimensional L_p spaces in the quantum model of computation. For the quantum query complexity of this problem matching (up to logarithmic factors) upper and lower bounds are obtained. The…
We consider the problem of determining whether a given prime p is a congruent number. We present an easily computed criterion that allows us to conclude that certain primes for which congruency was previously undecided, are in fact not…
Integer Quadratic Programming (IQP) is an important problem in operations research. Local search is a powerful method for solving hard problems, but the research on local search algorithms for IQP solving is still on its early stage. This…
We obtain divisibility conditions on the multiplicative orders of elements of the form $\zeta + \zeta^{-1}$ in a finite field by exploiting a link to the arithmetic of real quadratic fields.
This paper proposes new quadratic constraints (QCs) to bound a quadratic polynomial. Such QCs can be used in dissipation ineqaulities to analyze the stability and performance of nonlinear systems with quadratic vector fields. The proposed…
It is shown that when a real quadratic integer $\xi$ of fixed norm $\mu$ is considered, the fundamental unit $\varepsilon_d$ of the field $\mathbb{Q}(\xi) = \mathbb{Q}(\sqrt{d})$ satisfies $\log \varepsilon_d \gg (\log d)^2$ almost always.…
In this paper, we discuss an approximation strategy for solving the Linear Quadratic Tracking that is both forward and local in time. We exploit the known form of the value function along with a time reversal transformation that nicely…
The properties of local optimal solutions in multi-objective combinatorial optimization problems are crucial for the effectiveness of local search algorithms, particularly when these algorithms are based on Pareto dominance. Such local…
We study quantized non-local order parameters, constructed by using partial time-reversal and partial reflection, for fermionic topological phases of matter in one spatial dimension protected by an orientation reversing symmetry, using…
There has been growing interest in high-order tensor methods for nonconvex optimization, with adaptive regularization, as they possess better/optimal worst-case evaluation complexity globally and faster convergence asymptotically. These…
In this short note we confirm the relation between the generalized $abc$-conjecture and the $p$-rationality of number fields. Namely, we prove that given K$/\mathbb{Q}$ a real quadratic extension or an imaginary $S_3$-extension, if the…
We study the optimization version of the equal cardinality set partition problem (where the absolute difference between the equal sized partitions' sums are minimized). While this problem is NP-hard and requires exponential complexity to…
It has been well known since Gauss that the principality of an ideal in a real quadratic field $K$ is equivalent to the solvability of a certain generalized Pell equations. In this paper, we combine this classical result with Srinivasan's…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
We introduce and study in detail the notion of compatibility between valuations and orderings in real hyperfields. We investigate their relation with valuations and orderings induced on factor and residue hyperfields. Much of the theory…
This work deals with the presence of topological structures in models of two real scalar fields in the two-dimensional spacetime. The subject concerns the presence of a geometric constriction, which appears with a modification of the…
A model for two entangled systems in an EPR setting is shown to reproduce the quantum-mechanical outcomes and expectation values. Each system is represented by a small sphere containing a point-like particle embedded in a field. A quantum…
This text provides an introduction to distributed local algorithms -- an area at the intersection of theoretical computer science and discrete mathematics. We collect recent results in the area and demonstrate how they lead to a clean…
Local GCD Equivalence is a relation between extensions of number fields which is weaker than the classical arithmetic equivalence. It was originally studied by Lochter with Weak Kronecker Equivalence. Among the many results he got, Lochter…