On the Truncated Multidimensional Moment Problems in Cn

We consider the problem of finding a (non-negative) measure μ on B(Cn) such that ∫Cnzkdμ(z)=sk, ∀k∈K. Here, K is an arbitrary finite subset of Z+n, which contains (0,…,0), and sk are prescribed complex numbers (we use the usual notations for multi-indices). There are two possible interpretations of this problem. Firstly, one may consider this problem as an extension of the truncated multidimensional moment problem on Rn, where the support of the measure μ is allowed to lie in Cn. Secondly, the moment problem is a particular case of the truncated moment problem in Cn, with special truncations. We give simple conditions for the solvability of the above moment problem. As a corollary, we have an integral representation with a non-negative measure for linear functionals on some linear subspaces of polynomials.

Modular Frobenius pseudo-varieties

If $$m \in {\mathbb {N}} \setminus \{0,1\}$$ m ∈ N \ { 0 , 1 } and A is a finite subset of $$\bigcup _{k \in {\mathbb {N}} \setminus \{0,1\}} \{1,\ldots ,m-1\}^k$$ ⋃ k ∈ N \ { 0 , 1 } { 1 , … , m - 1 } k , then we denote by $$\begin{aligned} {\mathscr {C}}(m,A) =&\{ S\in {\mathscr {S}}_m \mid s_1+\cdots +s_k-m \in S \text { if } (s_1,\ldots ,s_k)\in S^k \text { and } \\ {}&\qquad (s_1 \bmod m, \ldots , s_k \bmod m)\in A \}. \end{aligned}$$ C ( m , A ) = { S ∈ S m ∣ s 1 + ⋯ + s k - m ∈ S if ( s 1 , … , s k ) ∈ S k and ( s 1 mod m , … , s k mod m ) ∈ A } . In this work we prove that $${\mathscr {C}}(m,A)$$ C ( m , A ) is a Frobenius pseudo-variety. We also show algorithms that allows us to establish whether a numerical semigroup belongs to $${\mathscr {C}}(m,A)$$ C ( m , A ) and to compute all the elements of $${\mathscr {C}}(m,A)$$ C ( m , A ) with a fixed genus. Moreover, we introduce and study three families of numerical semigroups, called of second-level, thin and strong, and corresponding to $${\mathscr {C}}(m,A)$$ C ( m , A ) when $$A=\{1,\ldots ,m-1\}^3$$ A = { 1 , … , m - 1 } 3 , $$A=\{(1,1),\ldots ,(m-1,m-1)\}$$ A = { ( 1 , 1 ) , … , ( m - 1 , m - 1 ) } , and $$A=\{1,\ldots ,m-1\}^2 \setminus \{(1,1),\ldots ,(m-1,m-1)\}$$ A = { 1 , … , m - 1 } 2 \ { ( 1 , 1 ) , … , ( m - 1 , m - 1 ) } , respectively.

Singularities of eight- and nine-particle amplitudes from cluster algebras and tropical geometry

We further exploit the relation between tropical Grassmannians and Gr(4, n) cluster algebras in order to make and refine predictions for the singularities of scattering amplitudes in planar $$ \mathcal{N} $$ N = 4 super Yang-Mills theory at higher multiplicity n ≥ 8. As a mathematical foundation that provides access to square-root symbol letters in principle for any n, we analyse infinite mutation sequences in cluster algebras with general coefficients. First specialising our analysis to the eight-particle amplitude, and comparing it with a recent, closely related approach based on scattering diagrams, we find that the only additional letters the latter provides are the two square roots associated to the four-mass box. In combination with a tropical rule for selecting a finite subset of variables of the infinite Gr(4, 9) cluster algebra, we then apply our results to obtain a collection of 3, 078 rational and 2, 349 square-root letters expected to appear in the nine-particle amplitude. In particular these contain the alphabet found in an explicit 2-loop NMHV symbol calculation at this multiplicity.

Necessary Conditions for Interpolation by Multivariate Polynomials

Let $$\Omega $$ Ω be a smooth, bounded, convex domain in $${\mathbb {R}}^n$$ R n and let $$\Lambda _k$$ Λ k be a finite subset of $$\Omega $$ Ω . We find necessary geometric conditions for $$\Lambda _k$$ Λ k to be interpolating for the space of multivariate polynomials of degree at most k. Our results are asymptotic in k. The density conditions obtained match precisely the necessary geometric conditions that sampling sets are known to satisfy and are expressed in terms of the equilibrium potential of the convex set. Moreover we prove that in the particular case of the unit ball, for k large enough, there are no bases of orthogonal reproducing kernels in the space of polynomials of degree at most k.

Bounds on Antipodal Spherical Designs with Few Angles

A finite subset $X$ on the unit sphere $\mathbb{S}^d$ is called an $s$-distance set with strength $t$ if its angle set $A(X):=\{\langle \mathbf{x},\mathbf{y}\rangle : \mathbf{x},\mathbf{y}\in X, \mathbf{x}\neq\mathbf{y} \}$ has size $s$, and $X$ is a spherical $t$-design but not a spherical $(t+1)$-design. In this paper, we consider to estimate the maximum size of such antipodal set $X$ for small $s$. Motivated by the method developed by Nozaki and Suda, for each even integer $s\in[\frac{t+5}{2}, t+1]$ with $t\geq 3$, we improve the best known upper bound of Delsarte, Goethals and Seidel. We next focus on two special cases: $s=3,\ t=3$ and $s=4,\ t=5$. Estimating the size of $X$ for these two cases is equivalent to estimating the size of real equiangular tight frames (ETFs) and Levenstein-equality packings, respectively. We improve the previous estimate on the size of real ETFs and Levenstein-equality packings. This in turn gives an upper bound on $|X|$ when $s=3,\ t=3$ and $s=4,\ t=5$, respectively.

On Pleijel’s Nodal Domain Theorem for Quantum Graphs

We establish metric graph counterparts of Pleijel’s theorem on the asymptotics of the number of nodal domains $$\nu _n$$ ν n of the nth eigenfunction(s) of a broad class of operators on compact metric graphs, including Schrödinger operators with $$L^1$$ L 1 -potentials and a variety of vertex conditions as well as the p-Laplacian with natural vertex conditions, and without any assumptions on the lengths of the edges, the topology of the graph, or the behaviour of the eigenfunctions at the vertices. Among other things, these results characterise the accumulation points of the sequence $$(\frac{\nu _n}{n})_{n\in \mathbb {N}}$$ ( ν n n ) n ∈ N , which are shown always to form a finite subset of (0, 1]. This extends the previously known result that $$\nu _n\sim n$$ ν n ∼ n generically, for certain realisations of the Laplacian, in several directions. In particular, in the special cases of the Laplacian with natural conditions, we show that for graphs any graph with pairwise commensurable edge lengths and at least one cycle, one can find eigenfunctions thereon for which $${\nu _n}\not \sim {n}$$ ν n ≁ n ; but in this case even the set of points of accumulation may depend on the choice of eigenbasis.

A link between minimal value set polynomials and tamely ramified towers of function fields over finite fields

In this paper, we introduce the notions of [Formula: see text]-polynomial and [Formula: see text]-minimal value set polynomial where [Formula: see text] is a polynomial over a finite field [Formula: see text] and [Formula: see text] is a finite subset of an algebraic closure of [Formula: see text]. We study some properties of these polynomials and we prove that the polynomials used by Garcia, Stichtenoth and Thomas in their work on good recursive tame towers are [Formula: see text]-minimal value set polynomials for [Formula: see text], whose [Formula: see text]-value sets can be explicitly computed in terms of the monomial [Formula: see text].

On Factoring Groups into Thin Subsets

A subset X of a group G is called thin if, for every finite subset F of G, there exists a finite subset H of G such that Fx∩Fy=∅, xF∩yF=∅ for all distinct x,y∈X\H. We prove that every countable topologizable group G can be factorized G=AB into thin subsets A,B.

Belief Change without Compactness

Dealing with dynamics is a vital problem in Artificial Intelligence (AI). An intelligent system should be able to perceive and interact with its environment to perform its tasks satisfactorily. To do so, it must sense external actions that might interfere with its tasks, demanding the agent to self-adapt to the environment dynamics. In AI, the field that studies how a rational agent should change its knowledge in order to respond to a new piece of information is known as Belief Change. It assumes that an agent’s knowledge is specified in an underlying logic that satisfies some properties including compactness: if an information is entailed by a set X of formulae, then this information should also be entailed by a finite subset of X. Several logics with applications in AI, however, do not respect this property. This is the case of many temporal logics such as LTL and CTL. Extending Belief Change to these logics would provide ways to devise self-adaptive intelligent systems that could respond to change in real time. This is a big challenge in AI areas such as planning, and reasoning with sensing actions. Extending belief change beyond the classical spectrum has been shown to be a tough challenge, and existing approaches usually put some constraints upon the system, which are either too restrictive or dispense some of the so desired rational behaviour an intelligent system should present. This is a summary of the thesis “Belief Change without Compactness” by Jandson S Ribeiro. The thesis extends Belief Change to accommodate non-compact logics, keeping the rationality criteria and without imposing extra constraints. We provide complete new semantic perspectives for Belief Change by extending to non-compact logics its three main pillars: the AGM paradigm, the KM paradigm and Non-monotonic Reasoning.

The dual cone of sums of non-negative circuit polynomials

For a non-empty, finite subset A ⊆ N 0 n $\mathcal{A} \subseteq \mathbb{N}_0^n$ let C sonc(𝒜) ∈ ℝ[x 1, . . . , xn ] be the cone of sums of non-negative circuit polynomials with support 𝒜. We derive a representation of the dual cone (C sonc(𝒜))∗ and deduce an optimality criterion for sums of non-negative circuit polynomials in polynomial optimization.