Questions tagged [algorithms]
Informally, an algorithm is a set of explicit instructions used to solve a problem (e.g. Euclid's algorithm for computing the greatest common divisor of two integers). For more specific questions on algorithms, this tag may be used in conjunction with the approximation-algorithms, algorithmic-randomness and algorithmic-topology tags.
463
questions with no upvoted or accepted answers
5
votes
0
answers
260
views
Differential operators that preserve real-rootedness
Is there some description of polynomial differential operators, $\mathcal{D}=\sum f_i(x) D_x^i$ such that, if $h$ is a polynomial all of whose roots are in $[0,1]$, then so are all the roots of $\...
- 151k
5
votes
0
answers
563
views
When is polytope compatible with network flow?
A linear program is the problem of optimizing an linear objective function within some polytope $A$ over $\mathbf R^n$. My question is motivated by the question of when a linear programming problem ...
- 3,407
4
votes
0
answers
123
views
Looking for a generalization of fast Fourier transform form for Gauss sums
I want to compute quickly compute a sum of the form
$$\sum_{k=0}^{N}\sum_{l=0}^{M} e(g^{a^k*b^l})$$
Assume $a^N = b^M = 1$ modulo $q-1$.
Where $e(x) = e^{2\pi ix /q}$. This is very similar to the ...
- 581
4
votes
0
answers
123
views
Lattice reduction of basis with non-integer coefficients
Suppose I have an ordered basis $\{b_1, \dots, b_n\}$ of a lattice in $\mathbb{R}^n$, but I do not assume that $b_i \in \mathbb{Z}^n$ for all $1 \leq i \leq n$.
I would like to perform lattice ...
- 554
4
votes
0
answers
101
views
Questions in number theory related to $NC$ and $P$-completeness
Given $a,b\in\mathbb N$ find $\operatorname{GCD}(a,b)$.
Given $a,b,c\in\mathbb N$ find $x,y\in\mathbb Z$ such that $ax+by=c$.
Euclidean algorithm solves both.
My question is if either 1 or 2 is in ...
- 13.7k
4
votes
0
answers
151
views
Two-player item picking game
Two players $A$ and $B$ play this game: There are $n$ items, where the $i$th item is of value $a_i$ to player $A$ and is of value $b_i$ to player $B$. Two players take turns picking items, and each ...
- 41
4
votes
0
answers
133
views
Given a large number $n$, check if it has a zero digit in base $b$
Given a large number $n$, check if it has a zero digit in base $b$. By large number I mean something like $2^{13579^{3597}}$ so direct computation of digits is not feasible.
- 103
4
votes
0
answers
192
views
Buchberger's criterion for Gröbner bases in $k$-algebras with multiplicative basis and admissible order
Let $R$ be an associative $k$-algebra with multiplicative basis $\mathcal B$ with an admissible order on $\mathcal B$.
Let $G \subseteq R$ be a subset.
A multiplicative basis $\mathcal B$ means that $...
- 141
4
votes
0
answers
210
views
What is the complexity class of this problem without Cramer's conjecture?
The problem 'Given $0<a<b$ is there a prime in the interval $[a,b]$?' is in $\mathsf{NP}$. If we assume Cramer's conjecture the problem is in $\mathsf{P}$ since if $b-a>(\log a)^{2+\epsilon}$ ...
- 13.7k
4
votes
0
answers
237
views
Can we make cryptography signature algorithm based on hardness of isomorphism?
In public key cryptography, Alice knows functions $f$ and its inverse
$f^{-1}$. $f$ is public and $f^{-1}$ is secret. To sign a message
$m$, she gives $(m,a=f^{-1}(m))$. To verify a signature, the ...
- 24.2k
4
votes
0
answers
203
views
Disjoint paths in temporal graphs
Given a graph $G=(V,E)$ and a pair of source-destination nodes $s$ and $t$. Time is divided in periods with the total number of periods denoted by $T$. Each edge $e$ is either operational or broken at ...
- 436
4
votes
0
answers
107
views
Algorithmically recover the $l'$-adic Galois representation from the $l$-adic one (assuming the Tate conjecture)
Let $E$ be a number field. For any finite Galois extension $E\subset F$ there is a continuous homomorphism $\pi_F:\mathrm{Gal}(\overline{E}/E)\to \mathrm{Gal}(F/E)$.
Let $X$ be a smooth projective ...
user158636
4
votes
0
answers
192
views
Finding integer solutions to $n=a^3+b^3+c^3-3abc = (a+b+c)(a^2+b^2+c^2-ab-ac-bc)$?
Is there anything known how to find integer solutions to
$$n=a^3+b^3+c^3-3abc = (a+b+c)(a^2+b^2+c^2-ab-ac-bc)$$
where $n$ is a natural number $\neq 3,6 \mod 9$ and $a,b,c \in \mathbb{Z}$?
Notice ...
user6671
4
votes
2
answers
317
views
Max weighted matching where edge weight depends on the matching
Given a bipartite graph $G$, we seek a maximal weighted matching $E$. The particularity is below. Once an edge $e$ is chosen, the action of choosing $e$ adds a negative weight $w(e,e')$ to any other ...
- 436
4
votes
0
answers
155
views
Subgroup membership problem for Noetherian groups
I am interested in the status of the subgroup membership problem (MP) for finitely presented Noetherian groups. That is, given a finite presentation $\langle X,R\rangle$ for a Noetherian group,
\begin{...
- 333
4
votes
0
answers
190
views
Generating a Penrose tessellation around a given tile
Given a starting Penrose tile, I need to build a "spiraling" tessellation around it.
The following picture illustrates the request:
In this example, the starting tile is a "thin rhombus" (the pink ...
- 145
4
votes
0
answers
193
views
Computational complexity for spectral radius of symmetric matrix
What is the best known algorithmic complexity for computing the spectral radius (largest eigenvalue in magnitude, possibly with respect to some precision and confidence) of a symmetric matrix of size $...
- 201
4
votes
0
answers
118
views
Finding short linear combinations in abelian groups
Let $M$ be a finitely generated abelian group. Assume we are given a presentation of $M$, that is
\begin{equation*}
M = \frac{\bigoplus_{i=1}^r \mathbf{Z}g_i}{\sum_{j=1}^s \mathbf{Z} r_j}
\end{...
- 20.5k
4
votes
0
answers
274
views
Parity of number of primes
In https://arxiv.org/abs/1009.3956 is it shown there is a $c>0$ such that $\pi(x)\bmod2$ can be computed in $o(x^{\frac12})$ time (more precisely number of primes $\bmod 2$ for an interval of ...
- 13.7k
4
votes
0
answers
94
views
Exploiting symmetries to speed up Groebner basis calculation?
Take a collection $F$ of homogeneous polynomials in $\mathbb{C}[x_1,\ldots,x_n]$, along with a finite group $G$ of linear operators over $\mathbb{C}^n$ such that for every $f\in F$ and $g\in G$, we ...
- 7,573
4
votes
0
answers
87
views
Efficient algorithm to construct path augmented graphs with smallest diameter?
I am interested in special graph constructions that have the smallest diameter. We have a path graph $P_n$ ($N$ is even). We add new set of edges $C$ between path nodes such that set $C$ forms a ...
- 2,951
4
votes
0
answers
139
views
In what range can we find diophantine approximations using the LLL-algorithm?
Let $\alpha_1, \ldots, \alpha_n$ be $\mathbb{Q}$-linearly independent real numbers. I want to show that for all $x_1, \ldots, x_n\in\mathbb{Z}$, $|x_i|<N$ we have some lower bound for $\left|\sum ...
4
votes
0
answers
182
views
Optimal instructions for the modular construction of rectlinear Lego structures
Let $X$ be a compact (or periodic) union of integer translates of unit cubes such that the interior of $X$ is connected. (If it makes any difference, suppose that the dimension $n$ of $X$ is 3.) I am ...
- 15.3k
4
votes
0
answers
86
views
Efficient CW structures on squarefree semi-algebraic set
General Setup
Given a collection of $k$ polynomials (with real coefficients) in $n$ real variables, say $f_i(x_1,\ldots,x_n)$, let $V \subset \mathbb{R}^n$ correspond to those $x$-values for which ...
- 15.5k
4
votes
0
answers
123
views
How to enumerate a discrete group of matrices by their Frobenius norm?
Suppose I have a discrete group $G<\mathrm{SL}_2(\mathbb{C})$,
and it is finitely generated by some known generators.
That is, $G=\langle g_1,\dots,g_n\rangle$.
The Frobenius norm of a matrix $m=\...
- 2,438
4
votes
0
answers
146
views
What is the influence of unreliable comparisons on the results of sorting
Considering sorting algorithms based solely on binary comparisons of the elements to be sorted(algorithms such as insertion sort, selection sort, quicksort, and so on), what problems do we face when ...
- 41
4
votes
0
answers
248
views
Comparison of Constrained Optimization Methods
I am trying to solve a constrained optimization problem using filter methods and came across two papers on the topic that I am having some problems with. The original filter method paper is the ...
4
votes
0
answers
2k
views
Weighted Median Filtering
Let's begin with a little review of unweighted median filtering.
Suppose I have a list of $N$ real-valued numbers, $x=x_1,...,x_N$. Let $m_i$ be the median of $K$ consecutive values: $m_i=$ median$(...
- 3,809
4
votes
0
answers
176
views
Computing the density of a set of multiples
Erdős and his coauthors often wrote about problems relating to the densities of sets of multiples. I have a computational question about the same topic. I have a finite* set $A=a_1<\cdots<a_r$ ...
- 8,984
4
votes
0
answers
192
views
What is the complexity of intersecting two matrix algebras over a finite field?
The following question arose in a joint project with Arkadius Kalka and Adi Ben-Zvi.
Let $\mathbb{F}$ be a finite field, and $M_n(\mathbb{F})$ be the $n\times n$ matrices over $\mathbb{F}$.
For a ...
- 3,104
4
votes
0
answers
175
views
What is known about the complexity of this covering problem?
Let $G=(V,E)$ be a graph. A vertex set $X\subseteq V$ is called critical if $X\neq\emptyset$ and no vertex in $V\setminus X$ is adjacent to exactly one vertex in $X$. The problem is to find a vertex ...
- 2,946
4
votes
0
answers
220
views
Navigation in a graph
The problem
Let $G=(V,E)$ be a graph. $k = O\left(\log(|V|)\right)$ distinct vertices are picked randomly from $V$. We call the set of chosen $k$ vertices $T$.
Assumptions about the graph: You may ...
- 323
4
votes
0
answers
214
views
What is the function like when its Mobius inversion is $\sum_{w|r, (w,t)=1}\mu(w)q^{r/w}$?
Everyone, I am now reading a paper named The Irreducible Factors of $(cx+d)x^{q^m}-(ax+b)$ over $GF(q)$, http://qjmath.oxfordjournals.org/content/14/1/61.extract. And I’m confused with one of its ...
- 41
4
votes
0
answers
130
views
Generating random weak k-bounded reverse plane partitions
Fix a partition $\lambda$. A weak reverse plane partition of shape $\lambda$ is a filling $0\leq \pi_{ij}$ of $\lambda$ with $\pi_{ij}\leq \pi_{kl}$ whenever $i\leq k$ or $j\leq l$. Note that $\pi_{ij}...
- 4,902
4
votes
0
answers
351
views
Comparing different Euclidean algorithms on a Euclidean domain
I have posted this question at stackexchange (502413), without responses until now.
In the papers by T. Motzkin: The Euclidean Algorithm, Bull. AMS 55, 1949, pp. 1142--1146 and P. Samuel: About ...
- 2,434
4
votes
0
answers
207
views
Rough structure of the double coset space/Graph bijections up to automorphisms
I am dealing with bijective maps $\pi:\Gamma_1\to \Gamma_2$ between two graphs with the same number of vertices $N=O(10)$.
The graphs have a significant automorphism group (these are disconnected ...
- 669
4
votes
0
answers
171
views
On understanding Discrete-Valued Stochastic Processes( time series, panel data )
It seems to me that a significant proportion of work in probability theory, statistics and machine learning are on understanding continuous-valued, relatively weakly dependent, or linear dependent ...
- 41
4
votes
0
answers
637
views
Checking whether an element is in all inclusion-wise maximal common independent sets of two matroids
Given two matroids $M$ and $M'$ over the same universe $E$, and some element $x \in E$, I am interested in the importance of $x$ for the intersection (the common independent sets) of $M$ and $M'$.
It ...
- 485
4
votes
0
answers
757
views
(Co)limit computations for diagrams of Vector Spaces
Fix a field $K$ and consider a finite directed graph $\Gamma$ where multiple edges between a pair of vertices are allowed so long as the total number of edges is finite. Associate to each vertex $v$ a ...
- 15.5k
4
votes
0
answers
391
views
Matching a binary matrix
Given a MxN 0-1 matrix D, with the property that
both M and N are odd numbers
its row sums and column sums in the $\mathbb{Z}_2$ field are all equal to the same number (0 or 1).
How do we find M ...
- 167
4
votes
0
answers
241
views
Domination in Nice Lattices
Let an integer vector be nice when it has only two nonzero components, which sum to zero. So (0, 0, 3, 0, -3) and (-1, 0, 1, 0, 0) are examples of nice vectors in $n=5$ dimensions.
Call a lattice ...
- 1,258
4
votes
0
answers
267
views
Finding generalised Lyndon words
Let $\Sigma = \lbrace a_1, \ldots, a_n, A_1, \ldots A_n \rbrace$ (where $A_i = a_i^{-1}$) and $\prec$ be a total ordering on $\Sigma$.
Let $\Sigma^*$ be the set of all words (generated by the ...
- 3,125
4
votes
0
answers
338
views
Can the Littlewood-Richardson cone be used for combinatorial optimization?
The Littlewood-Richardson cone $LR_{n, k}$ consists of all $k-$tuples $(a_1, a_2, \dots, a_k)$ of real $n-$vectors with monotonically decreasing entries such that there exist $k$ $n \times n-$...
- 313
4
votes
0
answers
164
views
The mathematics of Schellings segregation model
For those who don't know the model. You can read this pdf. I want to find what is the probability that 2 nodes are each others neighbors when the algorithm converges (i.e. when all nodes are happy).
...
- 41
3
votes
0
answers
36
views
Implementation of Friedman's algorithm of reconstructing simple polytopes
In Finding a Simple Polytope from Its Graph in Polynomial Time, Friedman gave a polynomial time algorithm on reconstructing a simple polytope from its graph. Has this algorithm been actually ...
3
votes
0
answers
87
views
Efficient multiplication of Cayley-Dickson numbers
The question was already asked here, but doesn't have any meaningful answer, hence I'd like to re-post it.
Assuming that we have an algebra with conjugation, we can use Cayley-Dickson construction to ...
- 1,141
3
votes
0
answers
64
views
Does this information theoretical thought experiment have a name or corresponding area of research?
I came up with the following thought experiment in my research in order to better understand the way Turing machines can transfer information through their tapes (the motivation is detailed below, isn'...
- 479
3
votes
0
answers
336
views
Is this FFT algorithm known?
Recently I've been thinking about alternatives to the usual Cooley-Tukey FFT for multiplying polynomials. I think I've come up with a pretty nifty algorithm for multiplying polynomials. So my question ...
- 31
3
votes
0
answers
99
views
Checking the generic rank of a matrix
Suppose that $A,B\in M_{p,q}(\mathbb{Z})$ are two rectangular integer matrices of the same size. Suppose that one has a conjecture stating that the rank of the matrix $A+tB$ for Zariski generic values ...
- 16.5k
3
votes
0
answers
107
views
Could a quantum computer factor $N=p\times q$ using Hadamard transforms on $x^2\bmod N$ (instead of Fourier transforms on $a^x\bmod N$)?
In Classically verifiable quantum advantage from a computational Bell test, Kahanamoku-Meyer, Choi, Vazirani, and Yao propose using $x^2 \bmod N$ in an interactive proof-of-quantumness. This is a two-...
- 2,143