English
Related papers

Related papers: Efficient congruencing in ellipsephic sets: the qu…

200 papers

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

Combinatorics · Mathematics 2026-04-21 Ahmad Abdi , Gérard Cornuéjols , Daniel Dadush , Mahsa Dalirrooyfard

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

Optimization and Control · Mathematics 2015-05-07 Alberto Del Pia , Robert Hildebrand , Robert Weismantel , Kevin Zemmer

This paper is devoted to the analysis of a numerical scheme based on the Finite Element Method for approximating the solution of Koiter's model for a linearly elastic elliptic membrane shell subjected to remaining confined in a prescribed…

Numerical Analysis · Mathematics 2024-03-12 Xin Peng , Paolo Piersanti , Xiaoqin Shen

This paper considers a distributionally robust chance constraint model with a general ambiguity set. We show that a sample based approximation of this model converges under suitable sufficient conditions. We also show that upper and lower…

Optimization and Control · Mathematics 2025-01-17 Jiaqi Lei , Sanjay Mehrotra

We consider certain systems of three linked simultaneous diagonal equations in ten variables with total degree exceeding five. By means of a complification argument, we obtain an asymptotic formula for the number of integral solutions of…

Number Theory · Mathematics 2021-06-09 Joerg Bruedern , Trevor D. Wooley

We investigate a variant of Wirsing's problem on approximation to a real number by real algebraic numbers of degree exactly $n$. This has been studied by Bugeaud and Teulie. We improve their bounds for degrees up to $n=7$. Moreover, we…

Number Theory · Mathematics 2024-09-11 Johannes Schleischitz

The 3-domatic number problem asks whether a given graph can be partitioned intothree dominating sets. We prove that this problem can be solved by a deterministic algorithm in time 2.695^n (up to polynomial factors). This result improves the…

Computational Complexity · Computer Science 2007-05-23 Tobias Riege , Jörg Rothe , Holger Spakowski , Masaki Yamamoto

The number of lattice points in $d$-dimensional hyperbolic or elliptic shells $\{m : a<Q[m]<b\}$, which are restricted to rescaled and growing domains $r\;\Omega$, is approximated by the volume. An effective error bound of order…

Number Theory · Mathematics 2021-11-16 Paul Buterus , Friedrich Götze , Thomas Hille , Gregory Margulis

We consider a semi-discrete finite volume scheme for a degenerate fractional conservation laws driven by a cylindrical Wiener process. Making use of the bounded variation (BV) estimates, Young measure theory, and a clever adaptation of…

Analysis of PDEs · Mathematics 2022-02-23 Ujjwal Koley , Guy Vallet

In this paper, we deal with an elliptic problem with the Dirichlet boundary condition. We operate in Sobolev spaces and the main analytic tool we use is the Lax-Milgram lemma. First, we present the variational approach of the problem which…

Analysis of PDEs · Mathematics 2025-02-12 Eriselda Goga , Besiana Hamzallari

We study the singular series associated to a cubic form with integer coefficients. If the number of variables is at least $10$, we prove the absolute convergence (and hence positivity) under the assumption of Davenport's Geometric…

Number Theory · Mathematics 2023-10-04 Christian Bernert

In this paper we give a new aggregation framework for linear Diophantine equations. In particular, we prove that an aggregated system of minimum size can be built in polynomial time. We also derive an analytic formula that gives the number…

Optimization and Control · Mathematics 2016-08-09 Pierre-Louis Poirion , Vu Khac Ky , Leo Liberti

An asymptotic formula for the number of prime solutions of a general diagonal system of Diophantine equations is established, contingent on the existence of an appropriate mean value bound and on local solvability. In conjunction with the…

Number Theory · Mathematics 2026-01-21 Alan Talmage

An algorithm is proposed, analyzed, and tested experimentally for solving stochastic optimization problems in which the decision variables are constrained to satisfy equations defined by deterministic, smooth, and nonlinear functions. It is…

Optimization and Control · Mathematics 2021-07-09 Frank E. Curtis , Daniel P. Robinson , Baoyu Zhou

The quadratic unconstrained binary optimization (QUBO) problem arises in diverse optimization applications ranging from Ising spin problems to classical problems in graph theory and binary discrete optimization. The use of preprocessing to…

Artificial Intelligence · Computer Science 2017-05-29 Fred Glover , Mark Lewis , Gary Kochenberger

A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…

Combinatorics · Mathematics 2009-03-03 Bjarke Hammersholt Roune

An agent who lacks preferences and instead makes decisions using criteria that are costly to create should select efficient sets of criteria, where the cost of making a given number of choice distinctions is minimized. Under mild…

Artificial Intelligence · Computer Science 2016-06-27 Michael Mandler

The essential matrix incorporates relative rotation and translation parameters of two calibrated cameras. The well-known algebraic characterization of essential matrices, i.e. necessary and sufficient conditions under which an arbitrary…

Computer Vision and Pattern Recognition · Computer Science 2019-12-30 E. V. Martyushev

Quantified constraints over the reals appear in numerous contexts. Usually existential quantification occurs when some parameter can be chosen by the user of a system, and univeral quantification when the exact value of a parameter is…

Logic in Computer Science · Computer Science 2025-07-23 Stefan Ratschan

Standard variational methods tend to obtain upper bounds on the ground state energy of quantum many-body systems. Here we study a complementary method that determines lower bounds on the ground state energy in a systematic fashion, scales…

Quantum Physics · Physics 2015-05-28 Tillmann Baumgratz , Martin B. Plenio
‹ Prev 1 8 9 10 Next ›